Document type
ArticleVersion
Published versionPublication date
All rights reserved
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/140070
Navigating Ultrasmall Worlds in Ultrashort Time
Journal Title
Authors
Director/Tutor
Journal ISSN
Volume Title
Related resource
Abstract
Random scale-free networks are ultrasmall worlds. The average length of the shortest paths in networks of size N scales as ln ln N . Here we show that these ultrasmall worlds can be navigated in ultrashort time. Greedy routing on scale-free networks embedded in metric spaces finds paths with the average length scaling also as ln ln N . Greedy routing uses only local information to navigate a network. Nevertheless, it finds asymptotically the shortest paths, a direct computation of which requires global topology knowledge. Our findings imply that the peculiar structure of complex networks ensures that the lack of global topological awareness has asymptotically no impact on the length of communication paths. These results have important consequences for communication systems such as the Internet, where maintaining knowledge of current topology is a major scalability bottleneck.
Subject (English)
Citation
Citation
BOGUÑÁ, Marián and KRIOUKOV, Dmitri. Navigating Ultrasmall Worlds in Ultrashort Time. Physical Review Letters. 2009. Vol. 102, num. 5, pags. 058701. ISSN 0031-9007. [consulted: 6 of June of 2026]. Available at: https://hdl.handle.net/2445/140070