Distance distribution and average shortest path length estimation in real-world networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6440 LNAI, Issue PART 1, 2010, Pages 322-333

  Ye, Qi ^a   Wu, Bin ^a   Wang, Bai ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

Average Shortest Path length; Sampling; Social Network Analysis; Vertex vertex Distance

Indexed keywords

ARTIFICIAL NETWORKS; COMPLEX NETWORKS; DISTANCE DISTRIBUTIONS; EMPIRICAL STUDIES; MASSIVE NETWORKS; REAL-WORLD; REAL-WORLD NETWORKS; SAMPLING ALGORITHM; SAMPLING STRATEGIES; SHORTEST PATH; SOCIAL NETWORK ANALYSIS; TIME COMPLEXITY; VERTEX-VERTEX DISTANCE;

ALGORITHMS; DATA MINING; ELECTRIC NETWORK ANALYSIS; ESTIMATION; NORMAL DISTRIBUTION; COMPUTATIONAL COMPLEXITY; GRAPH THEORY;

GRAPH THEORY; COMPLEX NETWORKS;

EID: 78650226577     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17316-5_32     Document Type: Conference Paper

References (17)

1. Watts, D.J., Strogatz, S.H.: Collective dynamics of 'small-world' networks. Nature 393, 440-442 (1998)
2. Latora, V., Marchiori, M.: Efficient Behavior of Small-World Networks. Phys. Rev. Lett. 87, 198701 (2001)
3. Zwick, U.: Exact and approximate distances in graphs - a survey. In: Proceeding of the 9th Annual European Symposium on Algorithms, pp. 33-48 (2001)
4. Newman, M.E.J.: The Structure and Function of Complex Networks. SIAM REVIEW 45, 167-256 (2003)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT, Cambridge (2001)
6. Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast Shortest Path Distance Estimation in Large Networks. In: Proceeding of CIKM, pp. 867-876 (2009)
7. Kleinberg, J., Slivkins, A., Wexler, T.: Triangulation and embedding using small sets of beacons. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 444-453. IEEE Computer Society, Washington (2004)
8. Albert, R., Jeong, H., Barabási, A.-L.: Diameter of the world wide web. Nature 401, 130-131 (1999)
9. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. In: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 251-262. ACM, New York (1999)
10. Lee, S.H., Kim, P.J., Jeong, H.: Statistical properties of sampled networks. Phys. Rev. E. 73, 16102 (2006)
11. Airoldi, E.M., Carley, K.M.: Sampling algorithms for pure network topologies: stability and separability of metric embeddings. SIGKDD Explorations 7, 13-22 (2005)
12. Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47-97 (2002)
13. Barabási, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science 286, 509-512 (1999)
14. Leskovec, J., Horvitz, E.: Planetary-scale views on a large instant-messaging network. In: Proceeding of the 17th International Conference on World Wide Web, pp. 915-924 (2008)
15. Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E. 78, 46110 (2008)
16. Ye, Q., Zhu, T., Hu, D., et al.: Cell Phone Mini Challenge Award: Exploring Temporal Communication in Mobile Call Graphs. In: 3rd IEEE Symposium on Visual Analytics Science and Technology, pp. 207-208. IEEE Press, Columbus (2008)
17. Ye, Q., Wu, B., et al.: TeleComVis: Exploring Temporal Communities in Telecom Networks. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, pp. 755-758. Springer, Bled Slovenia (2009)