The largest component in a subcritical random graph with a power law degree distribution

Details The largest component in a subcritical random graph with a power law degree distribution The largest component in a subcritical random graph with a power law degree distribution

2007-08-31

arxiv.org/abs/0708.4404v2

Annals of Applied Probability 2008, Vol. 18, No. 4, 1651-1668

Mathematics

Probability

Published in at http://dx.doi.org/10.1214/07-AAP490 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Inst

Scientific paper

10.1214/07-AAP490

It is shown that in a subcritical random graph with given vertex degrees satisfying a power law degree distribution with exponent $\gamma>3$, the largest component is of order $n^{1/(\gamma-1)}$. More precisely, the order of the largest component is approximatively given by a simple constant times the largest vertex degree. These results are extended to several other random graph models with power law degree distributions. This proves a conjecture by Durrett.

Affiliated with

Also associated with

No associations

Rating

The largest component in a subcritical random graph with a power law degree distribution 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 largest component in a subcritical random graph with a power law degree distribution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The largest component in a subcritical random graph with a power law degree distribution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-618496