Diameters in supercritical random graphs via first passage percolation

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

Research output: Contribution to journalArticlepeer-review


We study the diameter of C1, the largest component of the Erdos-Rényi random graph G(n, p) in the emerging supercritical phase, i.e., for p = 1+ε/n where ε3n → ∞ and ε = o(1). This parameter was extensively studied for fixed ε > 0, yet results for ε = o(1) outside the critical window were only obtained very recently. Prior to this work, Riordan and Wormald gave precise estimates on the diameter; however, these did not cover the entire supercritical regime (namely, when ε3n → ∞ arbitrarily slowly). uczak and Seierstad estimated its order throughout this regime, yet their upper and lower bounds differed by a factor of 1000/7. We show that throughout the emerging supercritical phase, i.e., for any ε = o(1) with ε3n → ∞, the diameter of C1 is with high probability asymptotic to D(ε, n) = (3/ε)log(ε3n). This constitutes the first proof of the asymptotics of the diameter valid throughout this phase. The proof relies on a recent structure result for the supercritical giant component, which reduces the problem of estimating distances between its vertices to the study of passage times in first-passage percolation. The main advantage of our method is its flexibility. It also implies that in the emerging supercritical phase the diameter of the 2-core of C1 is w.h.p. asymptotic to 2/3 D(ε,n), and the maximal distance in 1 between any pair of kernel vertices is w.h.p. asymptotic to 5/9D(ε,n).

Original languageEnglish (US)
Pages (from-to)729-751
Number of pages23
JournalCombinatorics Probability and Computing
Issue number5-6
StatePublished - Sep 2010

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Statistics and Probability
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Diameters in supercritical random graphs via first passage percolation'. Together they form a unique fingerprint.

Cite this