The Diameter of a Long-Range Percolation Graph

Random Structures and Algorithms

Volumn 21, Issue 1, 2002, Pages 1-13

  Coppersmith, Don ^a   Gamarnik, David ^a   Sviridenko, Maxim ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036335842     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10042     Document Type: Article

References (9)

1. 2 percolation models, Commun Math Phys 107 (1986), 611-647.
2. I. Benjamini and N. Berger, The diameter of long-range percolation clusters on finite cycles, Random Struct Alg 19(2) (2001), 102-111.
3. I. Benjamini, H. Kesten, Y. Peres, and O. Schramm, The geometry of the uniform spanning forest: Transitions in dimensions 4, 8, 12, . . . , to appear in Ann Math.
4. M. Biskup, work in preparation, 2001.
5. J. Kleinberg, The small-world phenomenon: An algorithmic perspective, Cornell Computer Science Technical Report 99-1776, Ithaca, NY, 1999.
6. S. Milgram, The small world problem, Psychol Today 2(1967), 60-67.
7. s percolation models: The existence of a transition for s ≤ 2, Commun Math Phys 180 (1986), 483-504.
8. L. S. Schulman, Long-range percolation in one dimension, J Phys A 16 (17) (1983), L639-L641.
9. D. Watts and S. Strogatz, Collective dynamics of small-world networks, Nature 393(1998), 440-442. (1998).