Article thumbnail

Navigability is a Robust Property

By Dimitris Achlioptas and Paris Siminelakis

Abstract

The Small World phenomenon has inspired researchers across a number of fields. A breakthrough in its understanding was made by Kleinberg who introduced Rank Based Augmentation (RBA): add to each vertex independently an arc to a random destination selected from a carefully crafted probability distribution. Kleinberg proved that RBA makes many networks navigable, i.e., it allows greedy routing to successfully deliver messages between any two vertices in a polylogarithmic number of steps. We prove that navigability is an inherent property of many random networks, arising without coordination, or even independence assumptions

Topics: Computer Science - Social and Information Networks, Computer Science - Data Structures and Algorithms, G.2.2, G.3
Year: 2015
DOI identifier: 10.1007/978-3-319-26784-5_7
OAI identifier: oai:arXiv.org:1501.04931

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.