The scaling window for a random graph with a given degree sequence

Details The scaling window for a random graph with a given degree sequence The scaling window for a random graph with a given degree sequence

2009-07-24

arxiv.org/abs/0907.4211v1

Mathematics

Combinatorics

20 Pages

Scientific paper

We consider a random graph on a given degree sequence ${\cal D}$, satisfying certain conditions. We focus on two parameters $Q=Q({\cal D}), R=R({\cal D})$. Molloy and Reed proved that Q=0 is the threshold for the random graph to have a giant component. We prove that if $|Q|=O(n^{-1/3} R^{2/3})$ then, with high probability, the size of the largest component of the random graph will be of order $\Theta(n^{2/3}R^{-1/3})$. If $|Q|$ is asymptotically larger than $n^{-1/3}R^{2/3}$ then the size of the largest component is asymptotically smaller or larger than $n^{2/3}R^{-1/3}$. Thus, we establish that the scaling window is $|Q|=O(n^{-1/3} R^{2/3})$.

Affiliated with

Also associated with

No associations

Rating

The scaling window for a random graph with a given degree sequence 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 scaling window for a random graph with a given degree sequence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The scaling window for a random graph with a given degree sequence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-308944