Efficient routeing in poisson small-world networks

Journal of Applied Probability

Volumn 43, Issue 3, 2006, Pages 678-686

  Draief, M ^a   Ganesh, A ^b,c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b MICROSOFT RESEARCH   (United States)

^c MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Routeing; Small world

Indexed keywords

EID: 34047145938     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1158784938     Document Type: Article

References (11)

1. HARBOUR, A. D. AND REINERT, G. (2001). Small worlds. Random Structures Algorithms 19, 54-74.
2. BENJAMINI, I. AND BERGER, N. (2001). The diameter of long-range percolation clusters on finite cycles. Random Structures Algorithms 19, 102-111.
3. BENJAMINI, I., KESTEN, H., PERES, Y. AND SCHRAMM, O. (2004). Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,.... Ann. Math. 160, 465-491.
4. COPPERSMITH, D., GAMARNIK, D. AND SVIRIDENKO, M. (2002). The diameter of a long-range percolation graph. Random Structures Algorithms 21, 1-13.
5. ERDOS, P. AND RÉNYI, A. (1959). On random graphs. I. Publ. Math. Debrecen 6, 290-297.
6. FRANCESCHETTI, M. AND MEESTER, R. (2003). Navigation in small world networks, a scale-free continuum model. Tech. Rep. UCB/ERL M03/33, EECS Department, University of California, Berkeley.
7. KLEINBERG, J. (2000). The small-world phenomenon: an algorithmic perspective. In Proc. 32nd Annual ACM Symp. Theory Comput., ACM, New York, pp. 163-170.
8. MILGRAM, S. (1967). The small world problem. Psychology Today 2, 60-67.
9. PENROSE, M. (2003). Random Geometric Graphs. Oxford University Press.
10. SHARMA, G. AND MAZUMDAR, R. R. (2005). Hybrid sensor networks: a small world. In Proc. 6th ACM Internat. Symp. Mobile Ad Hoc Networking Comput., ACM, New York, pp. 366-377.
11. WATTS, D. J. AND STROGATZ, S. H. (1967). Collective dynamics of small world networks. Nature 393, 440-442.