Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Arcaute, E., Chen, N., Kumar, R., Liben-Nowell, D., Mahdian, M., Nazerzadeh, H., & Xu, Y. (2007). Deterministic decentralized search in random graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4863 LNCS, pp. 187–194). Springer Verlag. https://doi.org/10.1007/978-3-540-77004-6_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
