Related Experiment Video
Updated: Jun 21, 2026

Modeling the Functional Network for Spatial Navigation in the Human Brain
Published on: October 13, 2023
Extended navigability of small world networks: exact results and new insights
Cécile Caretta Cartozo1, Paolo De Los Rios
1Institute of Theoretical Physics, Ecole Polytechnique Fédérale de Lausanne, CH-1015, Lausanne, Switzerland.
Abstract:
Navigability of networks, that is, the ability to find any given destination vertex starting from any other vertex, is crucial to their usefulness. In 2000 Kleinberg showed that optimal navigability could be achieved in small world networks provided that a special recipe was used to establish long range connections, and that a greedy algorithm, that ensures that the destination will be reached, is used. Here we provide an exact solution for the asymptotic behavior of such a greedy algorithm as a function of the system's parameters. Our solution enables us to show that the original claim that only a very special construction is optimal can be relaxed depending on further constraints, such as, for example, cost minimization, that must be satisfied.
More Related Videos
Related Concept Videos
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Extended Versions of Green’s Theorem
Net Change Theorem
Short-distance Transport of Resources
Interference: Path Lengths
Two special sources may be considered when they are in phase. This can be easily achieved by feeding the two sources from the same source. An example would be synchronizing the two speakers by feeding them with the same source, such as the sound waves produced by a tuning fork. This setup ensures that the two sources have the same frequency and are...
Network Covalent Solids
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...

