On the distribution of typical shortest-path lengths in connected random geometric graphs
- 165 Downloads
Stationary point processes in ℝ2 with two different types of points, say H and L, are considered where the points are located on the edge set G of a random geometric graph, which is assumed to be stationary and connected. Examples include the classical Poisson–Voronoi tessellation with bounded and convex cells, aggregate Voronoi tessellations induced by two (or more) independent Poisson processes whose cells can be nonconvex, and so-called β-skeletons being subgraphs of Poisson–Delaunay triangulations. The length of the shortest path along G from a point of type H to its closest neighbor of type L is investigated. Two different meanings of “closeness” are considered: either with respect to the Euclidean distance (e-closeness) or in a graph-theoretic sense, i.e., along the edges of G (g-closeness). For both scenarios, comparability and monotonicity properties of the corresponding typical shortest-path lengths C e∗ and C g∗ are analyzed. Furthermore, extending the results which have recently been derived for C e∗, we show that the distribution of C g∗ converges to simple parametric limit distributions if the edge set G becomes unboundedly sparse or dense, i.e., a scaling factor κ converges to zero and infinity, respectively.
KeywordsPoint process Aggregate tessellation β-skeleton Shortest path Palm mark distribution Stochastic monotonicity Scaling limit
Mathematics Subject Classification (2000)60D05 60G55 60F99 90B15
Unable to display preview. Download preview PDF.
- 3.Bose, P., Devroye, L., Evans, W., Kirkpatrick, D.: On the spanning ratio of Gabriel graphs and β-skeletons. In: Proceedings of the 5th Latin American Symposium on Theoretical Informatics (LATIN’02). Lecture Notes in Computer Science, vol. 2286, pp. 479–493. Springer, Berlin (2002) Google Scholar
- 5.Daley, D.J., Vere-Jones, D.: An Introduction to the Theory of Point Processes, vols. I/II. Springer, New York (2005/2008) Google Scholar
- 6.Durrett, R.: Probability: Theory and Examples, 2nd edn. Duxbury, Belmont (1996) Google Scholar
- 9.Illian, J., Penttinen, A., Stoyan, H., Stoyan, D.: Statistical Analysis and Modelling of Spatial Point Patterns. Wiley, New York (2008) Google Scholar
- 10.Kirkpatrick, D.G., Radke, J.D.: A framework for computational morphology. In: Toussaint, G.T. (ed.) Computational Geometry, pp. 217–248. North Holland, Amsterdam (1985) Google Scholar
- 11.Molchanov, I.S.: Theory of Random Sets. Springer, London (2005) Google Scholar
- 15.Stoyan, D., Kendall, W.S., Mecke, J.: Stochastic Geometry and Its Applications. Wiley, New York (1995) Google Scholar