Answers are grounded in this paper and cite their sources.
We consider the near-critical Erdős–Rényi random graph G(n, p) and provide a new probabilistic proof of the fact that, when p is of the form p=p(n)=1/n+λ/n4/3 and A is large, {equation*}P(|Cₘₐₓ|>An2/3) A-3/2e-A^3/8+λ A^2/2-λ^2A/2,{equation*} where Cₘₐₓ is the largest connected component of the graph. Our result allows A and λ to depend on n. While this result is already known, our proof relies only on conceptual and adaptable tools such as ballot theorems, whereas the existing proof relies on a combinatorial formula specific to Erdős–Rényi graphs, together with analytic estimates.
No takes yet. Share an insight, caveat, or question.
Ambroggio et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: