The average path length of scale free networks

Abstract In this paper, the exact solution of average path length in Barabasi–Albert model is given. The average path length is an important property of networks and attracts much attention in many areas. The Barabasi–Albert model, also called scale free model, is a popular model used in modeling real systems. Hence it is valuable for us to examine the average path length of scale free model. There are two answers, regarding the exact solution for the average path length of scale free networks, already provided by Newman and Bollobas respectively. As Newman proposed, the average path length grows as log( n ) with the network size n . However, Bollobas suggested that while it was true when m  = 1, the answer changed to log( n )/log(log( n )) when m  > 1. In this paper, as we propose, the exact solution of average path length of BA model should approach log( n )/log(log( n )) regardless the value of m . Finally, the simulation is presented to show the validity of our result.

[1]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[2]  John Scott.  Social Network Analysis , 1988 .

[3]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[4]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[5]  A. Barabasi,et al.  Hierarchical Organization of Modularity in Metabolic Networks , 2002, Science.

[6]  Béla Bollobás,et al.  The Diameter of a Scale-Free Random Graph , 2004, Comb..

[7]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[8]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[9]  S. N. Dorogovtsev,et al.  Pseudofractal scale-free web. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[11]  M. Newman,et al.  Network theory and SARS: predicting outbreak diversity , 2004, Journal of Theoretical Biology.

[12]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[13]  Hawoong Jeong,et al.  Complex scale-free networks , 2003 .

[14]  R. F. Cancho,et al.  Topology of technology graphs: small world patterns in electronic circuits. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[16]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.