Small Worlds as Navigable Augmented Networks - LIAFA_Image_Marked资料.pdf

Small Worlds as Navigable Augmented Networks — Model, Analysis, and Validation — Pierre Fraigniaud⋆ CNRS and University of Paris 7 Abstract. The small world phenomenon, a.k.a. the six degree of sepa- ration between individuals, was identified by Stanley Milgram at the end of the 60s. Milgram 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 (professional occupation, state of leaving, etc.). In his paper on small world navigability, Jon Kleinberg modeled this phenomenon in the framework of augmented networks, and analyzed the performances of greedy routing in augmented multi-dimensional meshes. This paper ob- jective is to survey the results that followed up Kleinberg seminal work, including results about: – extensions of the augmented network model, and variants of greedy routing, – designs of polylog-navigable graph classes, – the quest for universal augmentation schemes, and – discussions on the validation of the model in the framework of dou- bling metrics. 1 Greedy routing in augmented meshes 1.1 Modeling Milgram experiment Augmented graphs were introduced in [25, 26] for the purpose of understanding the small world phenomenon. Precisely, augmented graphs give a framework for modeling and analyzing the ”six degrees of separation” between individuals ob- served from Milgram experiment [37], stating that short chains of acquaintances between any pair of individuals can be discovered in a distributed manner. Note that the augmented graph model addresses navigability in small worlds, and therefore it goes further than just structura