Abstract
In this paper we study the diameter of the random graph G(n, p), i.e., the largest finite distance between two vertices, for a wide range of functions p = p(n). For p = λ/n with λ > 1 constant we give a simple proof of an essentially best possible result, with an Op(1) additive correction term. Using similar techniques, we establish two-point concentration in the case that np → ∞. For p =(1 + ε)/n with ε → 0, we obtain a corresponding result that applies all the way down to the scaling window of the phase transition, with an Op(1/ε) additive correction term whose (appropriately scaled) limiting distribution we describe. Combined with earlier results, our new results complete the determination of the diameter of the random graph G(n, p) to an accuracy of the order of its standard deviation (or better), for all functions p = p(n). Throughout we use branching process methods, rather than the more common approach of separate analysis of the 2-core and the trees attached to it.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.