Anatomy of a young giant component in the random graph

Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres

Research output: Contribution to journalArticle

Abstract

We provide a complete description of the giant component of the Erdos-Rényi random graph G(n, p) as soon as it emerges from the scaling window, i.e., for p = (1+ε)/n where ε3n →∞ and ε = o(1). Our description is particularly simple for ε = o(n-1/4), where the giant component C1 is contiguous with the following model (i.e., every graph property that holds with high probability for this model also holds w.h.p. for C1). Let Z be normal with mean 2\3ε3n and variance ε3n, and let K be a random 3-regular graph on 2[Z] vertices. Replace each edge of K by a path, where the path lengths are i.i.d. geometric with mean 1/ε. Finally, attach an independent Poisson(1-ε)-Galton-Watson tree to each vertex. A similar picture is obtained for larger ε = o(1), in which case the random 3-regular graph is replaced by a random graph with Nk vertices of degree k for k ≥ 3, where Nk has mean and variance of order εkn. This description enables us to determine fundamental characteristics of the supercritical random graph. Namely, we can infer the asymptotics of the diameter of the giant component for any rate of decay of ε, as well as the mixing time of the random walk on C1.

Original languageEnglish (US)
Pages (from-to)139-178
Number of pages40
JournalRandom Structures and Algorithms
Volume39
Issue number2
DOIs
StatePublished - Sep 2011

Fingerprint

Giant Component
Anatomy
Random Graphs
Regular Graph
Galton-Watson Tree
Mixing Time
Path Length
Erdös
Random walk
Siméon Denis Poisson
Scaling
Decay
Path
Graph in graph theory
Vertex of a graph
Model

Keywords

  • Contiguity
  • Giant component
  • Near critical random graph
  • Poisson cloning

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Mathematics(all)
  • Applied Mathematics

Cite this

Anatomy of a young giant component in the random graph. / Ding, Jian; Kim, Jeong Han; Lubetzky, Eyal; Peres, Yuval.

In: Random Structures and Algorithms, Vol. 39, No. 2, 09.2011, p. 139-178.

Research output: Contribution to journalArticle

Ding, Jian ; Kim, Jeong Han ; Lubetzky, Eyal ; Peres, Yuval. / Anatomy of a young giant component in the random graph. In: Random Structures and Algorithms. 2011 ; Vol. 39, No. 2. pp. 139-178.
@article{5ac55f11b01c425098fa542073e87668,
title = "Anatomy of a young giant component in the random graph",
abstract = "We provide a complete description of the giant component of the Erdos-R{\'e}nyi random graph G(n, p) as soon as it emerges from the scaling window, i.e., for p = (1+ε)/n where ε3n →∞ and ε = o(1). Our description is particularly simple for ε = o(n-1/4), where the giant component C1 is contiguous with the following model (i.e., every graph property that holds with high probability for this model also holds w.h.p. for C1). Let Z be normal with mean 2\3ε3n and variance ε3n, and let K be a random 3-regular graph on 2[Z] vertices. Replace each edge of K by a path, where the path lengths are i.i.d. geometric with mean 1/ε. Finally, attach an independent Poisson(1-ε)-Galton-Watson tree to each vertex. A similar picture is obtained for larger ε = o(1), in which case the random 3-regular graph is replaced by a random graph with Nk vertices of degree k for k ≥ 3, where Nk has mean and variance of order εkn. This description enables us to determine fundamental characteristics of the supercritical random graph. Namely, we can infer the asymptotics of the diameter of the giant component for any rate of decay of ε, as well as the mixing time of the random walk on C1.",
keywords = "Contiguity, Giant component, Near critical random graph, Poisson cloning",
author = "Jian Ding and Kim, {Jeong Han} and Eyal Lubetzky and Yuval Peres",
year = "2011",
month = "9",
doi = "10.1002/rsa.20342",
language = "English (US)",
volume = "39",
pages = "139--178",
journal = "Random Structures and Algorithms",
issn = "1042-9832",
publisher = "John Wiley and Sons Ltd",
number = "2",

}

TY - JOUR

T1 - Anatomy of a young giant component in the random graph

AU - Ding, Jian

AU - Kim, Jeong Han

AU - Lubetzky, Eyal

AU - Peres, Yuval

PY - 2011/9

Y1 - 2011/9

N2 - We provide a complete description of the giant component of the Erdos-Rényi random graph G(n, p) as soon as it emerges from the scaling window, i.e., for p = (1+ε)/n where ε3n →∞ and ε = o(1). Our description is particularly simple for ε = o(n-1/4), where the giant component C1 is contiguous with the following model (i.e., every graph property that holds with high probability for this model also holds w.h.p. for C1). Let Z be normal with mean 2\3ε3n and variance ε3n, and let K be a random 3-regular graph on 2[Z] vertices. Replace each edge of K by a path, where the path lengths are i.i.d. geometric with mean 1/ε. Finally, attach an independent Poisson(1-ε)-Galton-Watson tree to each vertex. A similar picture is obtained for larger ε = o(1), in which case the random 3-regular graph is replaced by a random graph with Nk vertices of degree k for k ≥ 3, where Nk has mean and variance of order εkn. This description enables us to determine fundamental characteristics of the supercritical random graph. Namely, we can infer the asymptotics of the diameter of the giant component for any rate of decay of ε, as well as the mixing time of the random walk on C1.

AB - We provide a complete description of the giant component of the Erdos-Rényi random graph G(n, p) as soon as it emerges from the scaling window, i.e., for p = (1+ε)/n where ε3n →∞ and ε = o(1). Our description is particularly simple for ε = o(n-1/4), where the giant component C1 is contiguous with the following model (i.e., every graph property that holds with high probability for this model also holds w.h.p. for C1). Let Z be normal with mean 2\3ε3n and variance ε3n, and let K be a random 3-regular graph on 2[Z] vertices. Replace each edge of K by a path, where the path lengths are i.i.d. geometric with mean 1/ε. Finally, attach an independent Poisson(1-ε)-Galton-Watson tree to each vertex. A similar picture is obtained for larger ε = o(1), in which case the random 3-regular graph is replaced by a random graph with Nk vertices of degree k for k ≥ 3, where Nk has mean and variance of order εkn. This description enables us to determine fundamental characteristics of the supercritical random graph. Namely, we can infer the asymptotics of the diameter of the giant component for any rate of decay of ε, as well as the mixing time of the random walk on C1.

KW - Contiguity

KW - Giant component

KW - Near critical random graph

KW - Poisson cloning

UR - http://www.scopus.com/inward/record.url?scp=79960525085&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79960525085&partnerID=8YFLogxK

U2 - 10.1002/rsa.20342

DO - 10.1002/rsa.20342

M3 - Article

VL - 39

SP - 139

EP - 178

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

SN - 1042-9832

IS - 2

ER -