Navigability is a robust property
From MaRDI portal
Publication:3460741
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.
Recommendations
Cited in
(8)- Distance-based index structures for fast similarity search
- Navigation in networks by the Bolyai-Lobachevsky hyperbolic geometry
- Symmetric graph properties have independent edges
- Symmetric graph properties have independent edges
- Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
- Informational cost and networks navigability
- A lower bound for network navigability
- A Doubling Dimension Threshold Θ(loglogn) for Augmented Graph Navigability
This page was built for publication: Navigability is a robust property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460741)