Edge percolation on a random regular graph of low degree (Q941299): Difference between revisions

Let \(G(n)\) be a random graph uniformly selected from the class of d-regular graphs on \({1,...,n}\). Here d is a fixed integer larger than 2 and n tends to infinity. The edges of \(G(n)\) are independently open with a common probability \(p=p(n)\) and \(G(n,p)\) is the subgraph with open edges in \(G(n)\). The threshold probability for emergence of a giant component in \(G(n,p)\) is \(1/(d-1)\). Conditions on \(p\) are given so that with high probability the order can be determined of the width of the transition window around the threshold.