Networks Become Navigable as Nodes Move and Forget
From MaRDI portal
Publication:3521914
DOI10.1007/978-3-540-70575-8_12zbMath1152.68326arXiv0803.0248OpenAlexW1565568508MaRDI QIDQ3521914
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.0248
Sums of independent random variables; random walks (60G50) Network design and communication in computer systems (68M10)
Related Items (4)
A statistical construction of power-law networks ⋮ Delay of Social Search on Small-World Graphs ⋮ Navigation in spatial networks: a survey ⋮ Greedy routing and the algorithmic small-world phenomenon
This page was built for publication: Networks Become Navigable as Nodes Move and Forget