Average message delivery time for small-world networks in the continuum limit

Authors:
Hazer Inaltekin;Mung Chiang;H. Vincent Poor
Affiliations:
ARC Special Research Centre for Ultra-Broadband Information Networks, Department of Electrical and Electronic Engineering, University of Melbourne, Parkville, VIC, Australia;Department of Electrical Engineering, Princeton University, Princeton, NJ;Department of Electrical Engineering, Princeton University, Princeton, NJ
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 4
Cited 2

The small-world phenomenon: an algorithmic perspective

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Linked

Linked
Social search in "Small-World" experiments

Proceedings of the 18th international conference on World wide web
The capacity of wireless networks

IEEE Transactions on Information Theory

An algebra of social distance

ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
ISW: Interest-Based Small World Network of P2P

International Journal of Software Science and Computational Intelligence

Quantified Score

Hi-index	754.84

Visualization

Abstract

This paper introduces a new model, the octopus model, for studying small-world networks. The model is proposed for general measure-metric spaces and parametrizes the generation of complex networks in terms of the distribution of long-range connections per node. This model allows for the generation of a wide spectrum of complex networks including the ones possessing the clustering features of the Watts-Strogatz model and those possessing the scale-free features of the Barabási model. Analytical expressions for the average message delivery time in small-world networks as a function of source-target separation are derived. These analytical formulas show that nodes tend to communicate with one another only through their short-range contacts, and the average message delivery time rises linearly when the separation between source and target is small. On the other hand, as this separation increases, long-range connections are more commonly used, and the average message delivery time rapidly saturates to a constant value and stays almost the same for large values of the separation. These results are consistent with previous experimental observations made by Travers and Milgram in 1969, as well as by others. Other somewhat surprising conclusions of the paper are that hubs have a limited effect in reducing the average message delivery time and that the variance of connectivity in small-world networks adversely affects this time.