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

Authors:
Qi Ye;Bin Wu;Bai Wang
Affiliations:
Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, Beijing, China;Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, Beijing, China;Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, Beijing, China
Venue:
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Year:
2010

Citing 8
Cited 1

On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Introduction to Algorithms

Introduction to Algorithms
Exact and Approximate Distances in Graphs - A Survey

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Triangulation and Embedding Using Small Sets of Beacons

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Sampling algorithms for pure network topologies: a study on the stability and the separability of metric embeddings

ACM SIGKDD Explorations Newsletter
Planetary-scale views on a large instant-messaging network

Proceedings of the 17th international conference on World Wide Web
TeleComVis: Exploring Temporal Communities in Telecom Networks

ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II
Fast shortest path distance estimation in large networks

Proceedings of the 18th ACM conference on Information and knowledge management

Four degrees of separation

Proceedings of the 3rd Annual ACM Web Science Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.