Analyzing Kleinberg's (and other) small-world Models
From MaRDI portal
Publication:5501497
DOI10.1145/1011767.1011794zbMath1321.05247OpenAlexW2083649025MaRDI QIDQ5501497
No author found.
Publication date: 3 August 2015
Published in: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1011767.1011794
Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)
Related Items (22)
Could any graph be turned into a small-world? ⋮ On the Diameter of Hyperbolic Random Graphs ⋮ On the Diameter of Hyperbolic Random Graphs ⋮ Eclecticism shrinks even small worlds ⋮ Orientation in social networks ⋮ Category-based routing in social networks: membership dimension and the small-world phenomenon ⋮ Kleinberg's grid unchained ⋮ Distance estimation and object location via rings of neighbors ⋮ Asymptotically optimal solutions for small world graphs ⋮ Depth of Field and Cautious-Greedy Routing in Social Networks ⋮ New stochastic local search approaches for computing preferred extensions of abstract argumentation ⋮ Neighbor selection and hitting probability in small-world graphs ⋮ Recovering the long-range links in augmented graphs ⋮ Greedy routing in small-world networks with power-law degrees ⋮ Navigation in spatial networks: a survey ⋮ Optimal routing in a small-world network ⋮ Improving Topological Routing in N2R Networks ⋮ Universal augmentation schemes for network navigability ⋮ Graph Embedding through Random Walk for Shortest Paths Problems ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ Navigable small-world networks with few random bits ⋮ Close to optimal decentralized routing in long-range contact networks
This page was built for publication: Analyzing Kleinberg's (and other) small-world Models
