Critical percolation on random regular graphs

Details Critical percolation on random regular graphs Critical percolation on random regular graphs

2007-07-19

arxiv.org/abs/0707.2839v2

Mathematics

Probability

47 pages

Scientific paper

We describe the component sizes in critical independent p-bond percolation on a random d-regular graph on n vertices, where d \geq 3 is fixed and n grows. We prove mean-field behavior around the critical probability p_c=1/(d-1). In particular, we show that there is a scaling window of width n^{-1/3} around p_c in which the sizes of the largest components are roughly n^{2/3} and we describe their limiting joint distribution. We also show that for the subcritical regime, i.e. p = (1-eps(n))p_c where eps(n)=o(1) but \eps(n)n^{1/3} tends to infinity, the sizes of the largest components are concentrated around an explicit function of n and eps(n) which is of order o(n^{2/3}). In the supercritical regime, i.e. p = (1+\eps(n))p_c where eps(n)=o(1) but eps(n)n^{1/3} tends to infinity, the size of the largest component is concentrated around the value (2d/(d-2))\eps(n)n and a duality principle holds: other component sizes are distributed as in the subcritical regime.

Affiliated with

Also associated with

No associations

Rating

Critical percolation on random regular graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Critical percolation on random regular graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Critical percolation on random regular graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-544381