Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-27T11:38:07.849Z Has data issue: false hasContentIssue false
  • English
  • Français

Asymptotics of geometrical navigation on a random set of points in the plane

Part of: Algorithms - Computer Science Geometric probability and stochastic geometry Probability theory on algebraic and topological structures Stochastic processes

Published online by Cambridge University Press:  01 July 2016

Nicolas Bonichon  and
Jean-François Marckert
Nicolas Bonichon*
Affiliation:
Université de Bordeaux
Jean-François Marckert*
Affiliation:
Université de Bordeaux
*
∗ Postal address: CNRS, LaBRI, Université de Bordeaux, 351 cours de la Libération, 33405 Talence cedex, France.
∗ Postal address: CNRS, LaBRI, Université de Bordeaux, 351 cours de la Libération, 33405 Talence cedex, France.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A navigation on a set of points S is a rule for choosing which point to move to from the present point in order to progress toward a specified target. We study some navigations in the plane where S is a nonuniform Poisson point process (in a finite domain) with intensity going to +∞. We show the convergence of the traveller's path lengths, and give the number of stages and the geometry of the traveller's trajectories, uniformly for all starting points and targets, for several navigations of geometric nature. Other costs are also considered. This leads to asymptotic results on the stretch factors of random Yao graphs and random θ-graphs.

Keywords

NavigationPoisson point processgreedy routingspatial networkproximity graph

MSC classification

Primary: 60D05: Geometric probability and stochastic geometry 68W40: Analysis of algorithms 60B10: Convergence of probability measures 60G55: Point processes
Type
Stochastic Geometry and Statistical Applications
Information
Advances in Applied Probability , Volume 43 , Issue 4 , December 2011 , pp. 899 - 942
Copyright
Copyright © Applied Probability Trust 2011 

Footnotes

Partially supported by the ANR project ALADDIN.

Partially supported by ANR-08-BLAN-0190-04A3.

References

Aldous, D. J. (2009). The shape theorem for route-lengths in connected spatial networks on random points. Preprint. Available at http://arvix.org/abs/0911.5301v1.Google Scholar
Aldous, D. J. and Kendall, W. S. (2008). Short-length routes in low-cost networks via Poisson line patterns. Adv. Appl. Prob. 40, 1–21.CrossRefGoogle Scholar
Aldous, D. J. and Shun, J. (2010). Connected spatial networks over random points and a route-length statistic. Statist. Sci. 25, 275–288.Google Scholar
Athreya, S., Roy, R. and Sarkar, A. (2008). Random directed trees and forest-drainage networks with dependence. Electron. J. Prob. 13, 2160–2189.Google Scholar
Baccelli, F. and Bordenave, C. (2007). The radial spanning tree of a Poisson point process. Ann. Appl. Prob. 17, 305–359.Google Scholar
Bhatt, A. G. and Roy, R. (2004). On a random directed spanning tree. Adv. Appl. Prob. 36, 19–42.Google Scholar
Bonichon, N., Gavoille, C., Hanusse, N. and Ilcinkas, D. (2010). Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces. In Graph Theoretic Concepts in Computer Science (Lecture Notes Comput. Sci. 6410), Springer, Berlin, pp. 266–278.CrossRefGoogle Scholar
Bordenave, C. (2008). Navigation on a Poisson point process. Ann. Appl. Prob. 18, 708–746.Google Scholar
Bose, P. et al. (2010). Pi/2-angle Yao graphs are spanners. ArXiv e-prints, 2010, 1001.2913. Preprint. Available at http://arvix.org/abs/1001.2913v1.Google Scholar
Clarkson, K. L. (1987). Approximation algorithms for shortest path motion planning. In STOC '87: Proc. 19th Annual ACM Symp. on Theory of Computing, ACM, New York, pp. 56–65.CrossRefGoogle Scholar
Ferrari, P. A., Fontes, L. R. G. and Wu, X.-Y. (2005). Two-dimensional Poisson trees converge to the Brownian web. Ann. Inst. H. Poincaré Prob. Statist. 41, 851–858.Google Scholar
Kallenberg, O. (1997). Foundations of Modern Probability. Springer, New York.Google Scholar
Keil, J. M. (1988). Approximating the complete Euclidean graph. In SWAT 88 (Halmstad, 1988; Lecture Notes Comput. Sci. 318), Springer, Berlin, pp. 208–213.Google Scholar
Li, X.-Y., Wan, P.-J. and Wang, Y. (2001). Power efficient and sparse spanner for wireless ad hoc networks. In Proc. IEEE 10th Internat. Conf. on Computer Communications and Networks, pp. 564–567.Google Scholar
O'Rourke, J. (2010). The Yao graph Y 6 is a spanner. Preprint. Available at http://arxiv.org/abs/1003.3713v2.Google Scholar
Penrose, M. D. and Wade, A. R. (2006). On the total length of the random minimal directed spanning tree. Adv. Appl. Prob. 38, 336–372.Google Scholar
Petrov, V. V. (1975). Sums of Independent Random Variables. Springer, New York.Google Scholar
Ruppert, J. and Seidel, R. (1991). Approximating the d-dimensional complete Euclidean graph. In 3rd Canadian Conf. Computational Geometry, pp. 207–210.Google Scholar
Yao, A. C. (1982). On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput. 11, 721–736.Google Scholar