Average path length in uncorrelated random networks with hidden variables

Details Average path length in uncorrelated random networks with hidden variables Average path length in uncorrelated random networks with hidden variables

2004-07-05

arxiv.org/abs/cond-mat/0407098v1

Phys. Rev. E 70, 056110 (2004)

Physics

Condensed Matter

Disordered Systems and Neural Networks

8 pages, 4 figures; see also cond-mat/0212230 and cond-mat/0308629

Scientific paper

10.1103/PhysRevE.70.056110

Analytic solution for the average path length in a large class of uncorrelated random networks with hidden variables is found. We apply the approach to classical random graphs of Erdos and Renyi (ER), evolving networks introduced by Barabasi and Albert (BA) as well as random networks with asymptotic scale-free connectivity distributions characterized by an arbitrary scaling exponent $\alpha>2$. Our result for $2<\alpha<3$ shows that structural properties of asymptotic scale-free networks including numerous examples of real-world systems are even more intriguing then ultra-small world behavior noticed in pure scale-free structures and for large system sizes $N\to\infty$ there is a saturation effect for the average path length.

Affiliated with

Also associated with

No associations

Rating

Average path length in uncorrelated random networks with hidden variables 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 Average path length in uncorrelated random networks with hidden variables, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Average path length in uncorrelated random networks with hidden variables will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-72629