Analyzing Kleinberg's (and other) small-world Models
- 25 July 2004
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 179-188
- https://doi.org/10.1145/1011767.1011794
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On the Fundamental Tradeoffs Between Routing Table Size and Network Diameter in Peer-to-Peer NetworksIEEE Journal on Selected Areas in Communications, 2004
- An Experimental Study of Search in Global Social NetworksScience, 2003
- Routing networks for distributed hash tablesPublished by Association for Computing Machinery (ACM) ,2003
- Modeling the Internet's large-scale topologyProceedings of the National Academy of Sciences, 2002
- Fault-tolerant routing in peer-to-peer systemsPublished by Association for Computing Machinery (ACM) ,2002
- The diameter of a long‐range percolation graphRandom Structures & Algorithms, 2002
- Using the small-world model to improve freenet performanceACM SIGCOMM Computer Communication Review, 2002
- The diameter of long‐range percolation clusters on finite cyclesRandom Structures & Algorithms, 2001
- The Diameter of Sparse Random GraphsAdvances in Applied Mathematics, 2001
- The Diameter of a Cycle Plus a Random MatchingSIAM Journal on Discrete Mathematics, 1988