On the searchability of small-world networks with arbitrary underlying structure

DOI10.1145/1806689.1806744zbMATH Open1293.05359OpenAlexW2062788739MaRDI QIDQ2875166FDOQ2875166

Pierre Fraigniaud, George Giakkoupis

Publication date: 13 August 2014

Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1806689.1806744

Recommendations

• The small-world phenomenon: an algorithmic perspective
• Analyzing Kleinberg's (and other) small-world models
• Optimal path search in small worlds, dimension matters
• Automata, Languages and Programming
• Close to optimal decentralized routing in long-range contact networks

zbMATH Keywords

social networkssmall worldsdecentralized search

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cited In (11)

• Low-Distortion Inference of Latent Similarities from a Multiplex Social Network
• The Routing of Complex Contagion in Kleinberg’s Small-World Networks
• Distance-based index structures for fast similarity search
• Decentralized search on spheres using small-world Markov chains: expected hitting times and structural properties
• Complex networks and decentralized search algorithms
• Trading Bit, Message, and Time Complexity of Distributed Algorithms
• Kleinberg's grid unchained
• Greedy routing and the algorithmic small-world phenomenon
• Content Search through Comparisons
• Asymptotically optimal solutions for small world graphs
• Greedy routing in small-world networks with power-law degrees

This page was built for publication: On the searchability of small-world networks with arbitrary underlying structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875166)