Connectivity of random geometric graphs related to minimal spanning forests

Advances in Applied Probability

Volumn 45, Issue 1, 2013, Pages 20-36

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

^a UNIVERSITY OF ULM   (Germany)

Author keywords

skeleton; point process; Continuum percolation; Descending chain; Minimal spanning forest

Indexed keywords

CONTINUUM PERCOLATION; DESCENDING CHAIN; EUCLIDEAN; MINIMAL SPANNING FOREST; POINT PROCESS; POISSON POINT PROCESS; RANDOM GEOMETRIC GRAPHS; RELATIVE NEIGHBORHOOD GRAPHS;

MUSCULOSKELETAL SYSTEM; SOLVENTS;

FORESTRY;

FORESTS; PERCOLATION; POISSON RATIO; SOLVENTS;

EID: 84879209224     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1363354101     Document Type: Article

References (20)

1. Aldous, D. J. (2009). Which connected spatial networks on random points have linear route-lengths? Preprint. Available at http://arxiv.org/abs/0911. 5296v1.
2. Aldous, D. and Lyons, R. (2007). Processes on unimodular random networks. Electron. J. Prob. 12, 1454- 1508.
3. Aldous, D. J. and Shun, J. (2010). Connected spatial networks over random points and a route-length statistic. Statist. Sci. 25, 275-288.
4. Aldous, D. and Steele, J. M. (1992). Asymptotics for Euclidean minimal spanning trees on random points. Prob. Theory Relat. Fields 92, 247-258.
5. Aldous, D. and Steele, J. M. (2004). The objective method: probabilistic combinatorial optimization and local weak convergence. In Probability on Discrete Structures (Encyclopedia Math. Sci. 110), ed. H. Kesten, Springer, Berlin.
6. Alexander, K. S. (1995). Percolation and minimal spanning forests in infinite graphs. Ann. Prob. 23, 87-104.
7. Błaszczyszyn, B. and Yogeshwaran, D. (2014). On comparison of clustering properties of point processes. To appear in Adv. Appl. Prob.
8. Daley, D. J. and Last, G. (2005). Descending chains, the lilypond model, and mutual-nearest-neighbour matching. Adv. Appl. Prob. 37, 604-628.
9. 3-δ cathodes based on structural segmentation of FIB-SEM images. Computational Materials Sci. 67, 48-62.
10. Grimmett, G. (1999). Percolation, 2nd edn. Springer, Berlin.
11. Holroyd, A. E. and Peres, Y. (2003). Trees and matchings from point processes. Electron. Commun. Prob. 8, 17-27.
12. Last, G. (2006). Stationary partitions and Palm probabilities. Adv. Appl. Prob. 38, 602-620.
13. Lawler, G. F. (1980). A self-avoiding random walk. Duke Math. J. 47, 655-693.
14. Liggett, T. M., Schonmann, R. H. and Stacey, A. M. (1997). Domination by product measures. Ann. Prob. 25, 71-95.
15. Lyons, R., Peres, Y. and Schramm, O. (2006). Minimal spanning forests. Ann. Prob. 34, 1665-1692.
16. Neuhäuser, D., Hirsch, C., Gloaguen, C. and Schmidt, V. (2012). On the distribution of typical shortest-path lengths in connected random geometric graphs. Queueing Systems 71, 199-220.
17. Penrose, M. D. and Yukich, J. E. (2001). Central limit theorems for some graphs in computational geometry. Ann. Appl. Prob. 11, 1005-1041.
18. Penrose, M. D. and Yukich, J. E. (2003). Weak laws of large numbers in geometric probability. Ann. Appl. Prob. 13, 277-303.
19. Timár, Á. (2006). Ends in free minimal spanning forests. Ann. Prob. 34, 865-869.
20. Toussaint, G. T. (1980). The relative neighbourhood graph of a finite planar set. Pattern Recognition 12, 261-268.