Percolation and Loop Statistics in Complex Networks

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

4 pages and 2 figures; A major revision has been made

Scientific paper

10.1140/epjb/e2008-00401-9

Complex networks display various types of percolation transitions. We show that the degree distribution and the degree-degree correlation alone are not sufficient to describe diverse percolation critical phenomena. This suggests that a genuine structural correlation is an essential ingredient in characterizing networks. As a signature of the correlation we investigate a scaling behavior in $M_N(h)$, the number of finite loops of size $h$, with respect to a network size $N$. We find that networks, whose degree distributions are not too broad, fall into two classes exhibiting $M_N(h)\sim ({constant})$ and $M_N(h) \sim (\ln N)^\psi$, respectively. This classification coincides with the one according to the percolation critical phenomena.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Percolation and Loop Statistics in Complex Networks 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 Percolation and Loop Statistics in Complex Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Percolation and Loop Statistics in Complex Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-547186

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.