The probability of unusually large components in the near-critical Erdos-R\'enyi graph
Abstract
The largest components of the critical Erdos-R\'enyi graph, G(n,p) with p=1/n, have size of order n2/3 with high probability. We give detailed asymptotics for the probability that there is an unusually large component, i.e. of size an2/3 for large a. Our results, which extend work of Pittel, allow a to depend upon n and also hold for a range of values of p around 1/n. We also provide asymptotics for the distribution of the size of the component containing a particular vertex.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.