On the searchability of small-world networks with arbitrary underlying structure
From MaRDI portal
Publication:2875166
DOI10.1145/1806689.1806744zbMath1293.05359MaRDI 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
91D30: Social networks; opinion dynamics
05C82: Small world graphs, complex networks (graph-theoretic aspects)
Related Items
Low-Distortion Inference of Latent Similarities from a Multiplex Social Network, Distance-based index structures for fast similarity search, Greedy routing and the algorithmic small-world phenomenon, Kleinberg's grid unchained, Greedy routing in small-world networks with power-law degrees, The Routing of Complex Contagion in Kleinberg’s Small-World Networks, Content Search through Comparisons, Trading Bit, Message, and Time Complexity of Distributed Algorithms