Answers are grounded in this paper and cite their sources.
Let d≥3 be a fixed integer, p∈(0,1), and let n≥1 be a positive integer such that dn is even. Let G(n,d,p) be a (random) graph on n vertices obtained by drawing uniformly at random a d-regular (simple) graph on [n] and then performing independent p-bond percolation on it, i.e. we independently retain each edge with probability p and delete it with probability 1−p. Let |Cmax| be the size of the largest component in G(n,d,p). We show that, when p is of the form p=(d−1)−1(1+λn−1∕3) for λ∈R, and A is large, P(|Cmax|>An2∕3)≍A−3∕2e−A3(d−1)(d−2) 8d2+λA2(d−1) 2d−λ2A(d−1) 2(d−2). This improves on a result of Nachmias and Peres. We also give an analogous asymptotic for the probability that a particular vertex is in a component of size larger than An2∕3.
No takes yet. Share an insight, caveat, or question.
Ambroggio et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: