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

DOI10.1145/1806689.1806744zbMath1293.05359OpenAlexW2062788739MaRDI QIDQ2875166

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

zbMATH Keywords

social networkssmall worldsdecentralized search

Mathematics Subject Classification ID

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

Related Items (8)

Kleinberg's grid unchained ⋮ Distance-based index structures for fast similarity search ⋮ Content Search through Comparisons ⋮ Greedy routing in small-world networks with power-law degrees ⋮ The Routing of Complex Contagion in Kleinberg’s Small-World Networks ⋮ Trading Bit, Message, and Time Complexity of Distributed Algorithms ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ Low-Distortion Inference of Latent Similarities from a Multiplex Social Network

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