On the distribution of typical shortest-path lengths in connected random geometric graphs

Queueing Systems

Volumn 71, Issue 1-2, 2012, Pages 199-220

  Neuhauser D ^a   Hirsch, C ^a   Gloaguen, C ^b   Schmidt, V ^a  

^a UNIVERSITY OF ULM   (Germany)

^b ORANGE LABS   (France)

Author keywords

Aggregate tessellation; Palm mark distribution; Point process; Scaling limit; Shortest path; Stochastic monotonicity; skeleton

Indexed keywords

AGGREGATES; GRAPH ALGORITHMS; MUSCULOSKELETAL SYSTEM; STOCHASTIC SYSTEMS;

PALM MARK DISTRIBUTION; POINT PROCESS; SCALING LIMITS; SHORTEST PATH; STOCHASTIC MONOTONICITY;

GRAPH THEORY;

EID: 84861932149     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/s11134-012-9276-z     Document Type: Article

References (18)

1. Aldous, D., Shun, J.: Connected spatial networks over random points and a route-length statistic. Stat. Sci. 25, 275-288 (2010).
2. Baccelli, F., Gloaguen, G., Zuyev, S.: Superposition of planar Voronoi tessellations. Stoch. Models 16, 69-98 (2000).
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).
4. Calka, P.: The distributions of the smallest disks containing the Poisson-Voronoi typical cell and the Crofton cell in the plane. Adv. Appl. Probab. 34, 702-717 (2002).
5. Daley, D. J., Vere-Jones, D.: An Introduction to the Theory of Point Processes, vols. I/II. Springer, New York (2005/2008).
6. Durrett, R.: Probability: Theory and Examples, 2nd edn. Duxbury, Belmont (1996).
7. Foss, S. G., Zuyev, S. A.: On a Voronoi aggregative process related to a bivariate Poisson process. Adv. Appl. Probab. 28, 965-981 (1996).
8. Gloaguen, C., Voss, F., Schmidt, V.: Parametric distributions of connection lengths for the efficient analysis of fixed access network. Ann. Télécommun. 66, 103-118 (2011).
9. Illian, J., Penttinen, A., Stoyan, H., Stoyan, D.: Statistical Analysis and Modelling of Spatial Point Patterns. Wiley, New York (2008).
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).
11. Molchanov, I. S.: Theory of Random Sets. Springer, London (2005).
12. Neveu, J.: Processus ponctuels. In: École d'Été de Probabilités de Saint-Flour VI. Lecture Notes in Mathematics, vol. 598, pp. 249-445. Springer, Berlin (1977).
13. Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003).
14. Schneider, R., Weil, W.: Stochastic and Integral Geometry. Springer, Berlin (2008).
15. Stoyan, D., Kendall, W. S., Mecke, J.: Stochastic Geometry and Its Applications. Wiley, New York (1995).
16. Tchoumatchenko, K., Zuyev, S.: Aggregate and fractal tessellations. Probab. Theory Relat. Fields 121, 198-218 (2001).
17. Voss, F., Gloaguen, C., Schmidt, V.: Scaling limits for shortest path lengths along the edges of stationary tessellations. Adv. Appl. Probab. 42, 936-952 (2010).
18. Voss, F., Gloaguen, C., Fleischer, F., Schmidt, V.: Densities of shortest path lengths in spatial stochastic networks. Stoch. Models 27, 141-167 (2011).