Abstract
The “Small World Phenomenon” a.k.a. “Six Degree of Separation Between Individuals” was identified by Stanley Milgram at the end of the 60s. Milgram’s experiment demonstrated that letters from arbitrary sources and bound to an arbitrary target can be transmitted along short chains of closely related individuals based solely on some characteristics of the target (occupation, state of leaving, etc.). In his seminal work, Jon Kleinberg modeled and analyzed this phenomenon in the framework of “augmented networks”. A network is navigable if it can be augmented by random links so that greedy routing performs in a polylogarithmic expected number of steps between any pair of nodes. This talk will survey the recent results in this field. In particular, the connections between navigability and low doubling dimension will be described. The possible use of the concept of navigable networks in the framework of Grid Computing and P2P networks will also be discussed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fraigniaud, P. (2006). Navigability of Small World Networks. In: Robert, Y., Parashar, M., Badrinath, R., Prasanna, V.K. (eds) High Performance Computing - HiPC 2006. HiPC 2006. Lecture Notes in Computer Science, vol 4297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11945918_1
Download citation
DOI: https://doi.org/10.1007/11945918_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68039-0
Online ISBN: 978-3-540-68040-6
eBook Packages: Computer ScienceComputer Science (R0)