The diameter of a cycle plus a random matching
SIAM Journal on Discrete Mathematics
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Using the small-world model to improve freenet performance
ACM SIGCOMM Computer Communication Review
Regular Article: The Diameter of Sparse Random Graphs
Advances in Applied Mathematics
The diameter of long-range percolation clusters on finite cycles
Random Structures & Algorithms
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Fault-tolerant routing in peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
The diameter of a long-range percolation graph
Random Structures & Algorithms
Efficient Routing in Networks with Long Range Contacts
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Routing networks for distributed hash tables
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
IEEE Journal on Selected Areas in Communications
Eclecticism shrinks even small worlds
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Analyzing and characterizing small-world graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Distance estimation and object location via rings of neighbors
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Close to optimal decentralized routing in long-range contact networks
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Could any graph be turned into a small-world?
Theoretical Computer Science - Complex networks
Robust network connectivity: when it's the big picture that matters
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Eclecticism shrinks even small worlds
Distributed Computing - Special issue: PODC 04
Universal augmentation schemes for network navigability: overcoming the √n-barrier
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
A doubling dimension threshold θ(loglogn) for augmented graph navigability
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Navigating low-dimensional and hierarchical population networks
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Proximity breeds danger: emerging threats in metro-area wireless networks
SS'07 Proceedings of 16th USENIX Security Symposium on USENIX Security Symposium
Polylogarithmic network navigability using compact metrics with small stretch
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Opportunistic spatial gossip over mobile social networks
Proceedings of the first workshop on Online social networks
Recovering the Long-Range Links in Augmented Graphs
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Universal augmentation schemes for network navigability
Theoretical Computer Science
The effect of power-law degrees on the navigability of small worlds: [extended abstract]
Proceedings of the 28th ACM symposium on Principles of distributed computing
Enforcing access control in Web-based social networks
ACM Transactions on Information and System Security (TISSEC)
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Navigable Small-World networks with few random bits
Theoretical Computer Science
Recovering the long-range links in augmented graphs
Theoretical Computer Science
Improving topological routing in N2R networks
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Small worlds as navigable augmented networks: model, analysis, and validation
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Depth of field and cautious-greedy routing in social networks
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Generalizing Kronecker graphs in order to model searchable networks
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
On the searchability of small-world networks with arbitrary underlying structure
Proceedings of the forty-second ACM symposium on Theory of computing
Graph embedding through random walk for shortest paths problems
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
A Lower Bound for Network Navigability
SIAM Journal on Discrete Mathematics
Optimal path search in small worlds: dimension matters
Proceedings of the forty-third annual ACM symposium on Theory of computing
Near optimal routing in a small-world network with augmented local awareness
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Greedy routing in tree-decomposed graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Self-optimizing DHTs using request profiling
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Asymptotically optimal solutions for small world graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
How much independent should individual contacts be to form a small–world?
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
A multi-layer framework for personalized social tag-based applications
Data & Knowledge Engineering
Complex contagion and the weakness of long ties in social networks: revisited
Proceedings of the fourteenth ACM conference on Electronic commerce
Category-based routing in social networks: Membership dimension and the small-world phenomenon
Theoretical Computer Science
Hi-index | 0.01 |
We analyze the properties of Small-World networks, where links are much more likely to connect "neighbor nodes" than distant nodes. In particular, our analysis provides new results for Kleinberg's Small-World model and its extensions. Kleinberg adds a number of directed long-range random links to an nxn lattice network (vertices as nodes of a grid, undirected edges between any two adjacent nodes). Links have a non-uniform distribution that favors arcs to close nodes over more distant ones. He shows that the following phenomenon occurs: between any two nodes a path with expected length O(log2n) can be found using a simple greedy algorithm which has no global knowledge of long-range links.We show that Kleinberg's analysis is tight: his algorithm achieves θ(log2n) delivery time. Moreover, we show that the expected diameter of the graph is θlog n), a log n factor smaller. We also extend our results to the general k-dimensional model. Our diameter results extend traditional work on the diameter of random graphs which largely focuses on uniformly distributed arcs. Using a little additional knowledge of the graph, we show that we can find shorter paths: with expected length O(log3/2n) in the basic 2-dimensional model and O(log1+1/k) in the general k-dimensional model (fork≥1).Finally, we suggest a general approach to analyzing a broader class of random graphs with non-uniform edge probabilities. Thus we show expected θ(log n) diameter results for higher dimensional grids, as well as settings with less uniform base structures: where links can be missing, where the probability can vary at different nodes, or where grid-related factors (e.g. the use of lattice distance) has a weaker role or is dismissed, and constraints (such as the uniformness of degree distribution) are relaxed.