Navigation on a poisson point process

Annals of Applied Probability

Volumn 18, Issue 2, 2008, Pages 708-746

  Bordenave, Charles ^a,b  

^a UNIVERSITY OF CALIFORNIA

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Local weak convergence; Poisson point process; Random spanning trees; Small world phenomenon; Stochastic geometry

Indexed keywords

EID: 52949130661     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/07-AAP472     Document Type: Article

References (29)

1. ALDOUS, D. and STEELE, J. M. (2004). The objective method: Probabilistic combinatorial optimization and local weak convergence. In Probability on Discrete Structures. Encyclopaedia Math. Sci. 110 1-72. Springer, Berlin. MR2023650
2. ATHREYA, K. and NEY, P. (1978). A new approach to the limit theory of recurrent Markov chains. Trans. Amer. Math. Soc. 245 493-501. MR0511425
3. BACCELLI, F. and BORDENAVE, C. (2007). The radial spanning tree of a Poisson point process. Ann. Appl. Probab. 17 305-359. MR2292589
4. BACCELLI, F. and BRÉMAUD, P. (2003). Elements of Queuing Theory, 2nd ed. Springer, Berlin. MR1957884
5. BACCELLI, F., TCHOUMATCHENKO, K. and ZUYEV, S. (2000). Markov paths on the Poisson-Delaunay graph with applications to routing in mobile networks. Adv. in Appl. Probab. 32 1-18. MR1765174
6. BAUM, L. and KATZ, M. (1965). Convergence rates in the law of large numbers. Trans. Amer. Math. Soc. 120 108-123. MR0198524
7. BORDENAVE, C. Navigation on a Poisson point process. Available at http://arxiv.org/abs/math/0601122.
8. DRAIEF, M. and GANESH, A. (2006). Efficient routeing in Poisson small-world networks. J. Appl. Probab. 43 678-686. MR2274792
9. FERRARI, P., LANDIM, C. and THORISSON, H. (2004). Poisson trees, succession lines and coalescing random walks. Ann. Inst. H Poincaré Probab. Statist. 40 141-152. MR2044812
10. FRANCESCHETTI, M. and MEESTER, R. (2006). Navigation in small-world networks: A scale-free continuum model. J. Appl. Probab. 43 1173-1180. MR2274645
11. GANESH, A., KERMARREC, A. and MASSOULIE, L. (2003). Peer-to-peer membership management for gossip-based protocols. IEEE Trans. Comp. 52 139-149.
12. GANESH, A. and XUE, F. (2005). On the connectivity and diameter of small-world networks. MSR Technical report.
13. GANGOPADHYAY, S., ROY, R. and SARKAR, A. (2004). Random oriented trees: A model of drainage networks. Ann. Appl. Probab. 14 1242-1266. MR2071422
14. GUT, A. (1980). Convergence rates for probabilities of moderate deviations for sums of random variables with multidimensional indices. Ann. Probab. 8 298-313. MR0566595
15. HOWARD, C. and NEWMAN, C. (2001). Geodesies and spanning trees for Euclidean first-passage percolation. Ann. Probab. 29 577-623. MR1849171.
16. KLEINBERG, J. (2000). The small-world phenomenon: An algorithmic perspective. In Proc. 32nd Annual ACM Symposium on the Theory of Computing 163-170. ACM, New York. MR2114529
17. KO, Y. and VAIDYA, N. (2000). Location-aided routing (lar) in mobile ad hoc networks. Wireless Networks 6 307-321.
18. KRANAKIS, E., SINGH, H. and URRUTIA, J. (1999). Compass routing on geometric networks. In Proc. 11th Canadian Conference on Computational Geometry 51-54.
19. LEE, S. (1997). The central limit theorem for Euclidean minimal spanning trees. I. Ann. Appl. Probab. 7 996-1020. MR1484795
20. LIEBEHERR, J., NAHAS, M. and ST, W. (2002). Application-layer multicasting with Delaunay triangulation overlays. IEEE J. Selected Areas in Communications 20 1472-1488.
21. MEYN, S. and TWEEDIE, R. (1993). Markov Chains and Stochastic Stability. Springer, London. MR1287609
22. MORIN, P. (2001). Online routing in geometric graphs. Ph.D. thesis, School of Computer Science, Carleton Univ.
23. PENROSE, M. and WADE, A. (2004). Random minimal directed spanning trees and Dickman-type distributions. Adv. in Appl. Probab. 36 691-714. MR2079909
24. PENROSE, M. and YUKICH, J. (2001). Limit theory for random sequential packing and deposition. Ann. Appl. Probab. 12 272-301. MR1890065
25. PENROSE, M. and YUKICH, J. (2003). Weak laws of large numbers in geometric probability. Ann. Appl. Probab. 13 277-303. MR1952000
26. PIMENTEL, L. (2005). Asymptotics for first-passage times on Delaunay triangulations. Available at www.arxiv.org.labs/math/051.0605.
27. PLAXTON, G., RAIARAMAN, R. and RICHA, A. (1997). Accessing nearby copies of replicated objects in a distributed environment. In ACM Symposium on Parallel Algorithms and Architectures 311-320. ACM, New York.
28. VAHIDI-ASL, M. and WIERMAN, J. (1990). First-passage percolation on the Voronoǐ tessellation and Delaunay triangulation. In Random Graphs'87 (Poznań, 1987) 341-359. Wiley, Chichester. MR1094141
29. VAHIDI-ASL, M. and WIERMAN, J. (1992). A shape result for first-passage percolation on the Voronoǐ tessellation and Delaunay triangulation. In Random Graphs 2 (Poznań, 1989) 247-262. Wiley, New York. MR1166620