The phase transition in the configuration model

Details The phase transition in the configuration model The phase transition in the configuration model

2011-04-04

arxiv.org/abs/1104.0613v1

Combinatorics, Probability and Computing 21 (2012), 265--299

Mathematics

Probability

37 pages

Scientific paper

10.1017/S0963548311000666

Let $G=G(d)$ be a random graph with a given degree sequence $d$, such as a random $r$-regular graph where $r\ge 3$ is fixed and $n=|G|\to\infty$. We study the percolation phase transition on such graphs $G$, i.e., the emergence as $p$ increases of a unique giant component in the random subgraph $G[p]$ obtained by keeping edges independently with probability $p$. More generally, we study the emergence of a giant component in $G(d)$ itself as $d$ varies. We show that a single method can be used to prove very precise results below, inside and above the `scaling window' of the phase transition, matching many of the known results for the much simpler model $G(n,p)$. This method is a natural extension of that used by Bollobas and the author to study $G(n,p)$, itself based on work of Aldous and of Nachmias and Peres; the calculations are significantly more involved in the present setting.

Affiliated with

Also associated with

No associations

Rating

The phase transition in the configuration model 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 The phase transition in the configuration model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The phase transition in the configuration model will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-318316