Component sizes in networks with arbitrary degree distributions

Details Component sizes in networks with arbitrary degree distributions Component sizes in networks with arbitrary degree distributions

2007-06-30

arxiv.org/abs/0707.0080v1

Phys. Rev. E 76, 045101 (2007)

Physics

Condensed Matter

Statistical Mechanics

5 pages, 1 figure

Scientific paper

10.1103/PhysRevE.76.045101

We give an exact solution for the complete distribution of component sizes in random networks with arbitrary degree distributions. The solution tells us the probability that a randomly chosen node belongs to a component of size s, for any s. We apply our results to networks with the three most commonly studied degree distributions -- Poisson, exponential, and power-law -- as well as to the calculation of cluster sizes for bond percolation on networks, which correspond to the sizes of outbreaks of SIR epidemic processes on the same networks. For the particular case of the power-law degree distribution, we show that the component size distribution itself follows a power law everywhere below the phase transition at which a giant component forms, but takes an exponential form when a giant component is present.

Affiliated with

Also associated with

No associations

Rating

Component sizes in networks with arbitrary degree distributions 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 Component sizes in networks with arbitrary degree distributions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Component sizes in networks with arbitrary degree distributions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-144149