Distance Distribution and Average Shortest Path Length Estimation in Real-World Networks

The average shortest path length is one of the most important and frequent-invoked characteristics of real-world complex networks. However, the high time complexity of the algorithms prevents us to apply them to calculate the average shortest path lengths in real-world massive networks. In this paper, we present an empirical study of the vertex-vertex distance distributions in more than 30 artificial and realworld networks. To best of our knowledge, we are the first to find out the vertex-vertex distance distributions in these networks conform well to the normal distributions with different means and variations. We also investigate how to use the sampling algorithms to estimate the average shortest path lengths in these networks. Comparing our average shortest path estimating algorithm with other three different sampling strategies, the results show that we can estimate the average shortest path length quickly by just sampling a small number of vertices in both of real-world and artificial networks.

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

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

[3]  Jure Leskovec,et al.  Planetary-scale views on a large instant-messaging network , 2008, WWW.

[4]  Hawoong Jeong,et al.  Statistical properties of sampled networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[7]  Edoardo M. Airoldi,et al.  Sampling algorithms for pure network topologies: a study on the stability and the separability of metric embeddings , 2005, SKDD.

[8]  Jon M. Kleinberg,et al.  Triangulation and Embedding Using Small Sets of Beacons , 2004, FOCS.

[9]  V Latora,et al.  Efficient behavior of small-world networks. , 2001, Physical review letters.

[10]  Bin Wu,et al.  TeleComVis: Exploring Temporal Communities in Telecom Networks , 2009, ECML/PKDD.

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

[12]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[13]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[14]  David R. Oran,et al.  Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication , 1995, SIGCOMM 1995.

[15]  Uri Zwick,et al.  Exact and Approximate Distances in Graphs - A Survey , 2001, ESA.

[16]  Aristides Gionis,et al.  Fast shortest path distance estimation in large networks , 2009, CIKM.

[17]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .