A local limit theorem for the critical random graph

R.W. Hofstad, van der; W. Kager; T. Müller

A local limit theorem for the critical random graph

R.W. Hofstad, van der
, W. Kager
, T. Müller

Research output: Contribution to journal › Article › Academic › peer-review

10 Citations (Scopus)

100 Downloads (Pure)

Abstract

We consider the limit distribution of the orders of the k largest components in the Erd¿os-Rényi random graph inside the "critical window" for arbitrary k. We prove a local limit theorem for this joint distribution and derive an exact expression for the joint probability density function.

Original language	English
Pages (from-to)	122-131
Journal	Electronic Communications in Probability
Volume	14
Publication status	Published - 2009

Access to Document

Metis225117Final published version, 134 KB

Cite this

@article{b4d77c6b0acd45d0b88201ceede11834,

title = "A local limit theorem for the critical random graph",

abstract = "We consider the limit distribution of the orders of the k largest components in the Erd¿os-R{\'e}nyi random graph inside the {"}critical window{"} for arbitrary k. We prove a local limit theorem for this joint distribution and derive an exact expression for the joint probability density function.",

author = "\{Hofstad, van der\}, R.W. and W. Kager and T. M{\"u}ller",

year = "2009",

language = "English",

volume = "14",

pages = "122--131",

journal = "Electronic Communications in Probability",

issn = "1083-589X",

publisher = "Institute of Mathematical Statistics",

}

TY - JOUR

T1 - A local limit theorem for the critical random graph

AU - Hofstad, van der, R.W.

AU - Kager, W.

AU - Müller, T.

PY - 2009

Y1 - 2009

N2 - We consider the limit distribution of the orders of the k largest components in the Erd¿os-Rényi random graph inside the "critical window" for arbitrary k. We prove a local limit theorem for this joint distribution and derive an exact expression for the joint probability density function.

AB - We consider the limit distribution of the orders of the k largest components in the Erd¿os-Rényi random graph inside the "critical window" for arbitrary k. We prove a local limit theorem for this joint distribution and derive an exact expression for the joint probability density function.

M3 - Article

SN - 1083-589X

VL - 14

SP - 122

EP - 131

JO - Electronic Communications in Probability

JF - Electronic Communications in Probability

ER -

A local limit theorem for the critical random graph

Abstract

Access to Document

Fingerprint

Cite this