Open Access
2008 Deterministic Decentralized Search in Random Graphs
Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, Ying Xu
Internet Math. 5(1-2): 141-154 (2008).


We study a general framework for decentralized search in random graphs. Our main focus is on deterministic memoryless search algorithms that use only local information to reach their destination in a bounded number of steps in expectation. This class includes (with small modifications) the search algorithms used in Kleinberg's pioneering work on long-range percolation graphs and hierarchical network models. We give a characterization of searchable graphs in this model, and use this characterization to prove a monotonicity property for searchability.


Download Citation

Esteban Arcaute. Ning Chen. Ravi Kumar. David Liben-Nowell. Mohammad Mahdian. Hamid Nazerzadeh. Ying Xu. "Deterministic Decentralized Search in Random Graphs." Internet Math. 5 (1-2) 141 - 154, 2008.


Published: 2008
First available in Project Euclid: 25 November 2009

zbMATH: 1136.68318
MathSciNet: MR2504916

Rights: Copyright © 2008 A K Peters, Ltd.

Vol.5 • No. 1-2 • 2008
Back to Top