Weak laws of large numbers in geometric probability
Publication:1872342
DOI10.1214/AOAP/1042765669zbMath1029.60008OpenAlexW2021695397MaRDI QIDQ1872342
Mathew D. Penrose, Joseph E. Yukich
Publication date: 6 May 2003
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1042765669
computational geometryBoolean modelweak law of large numbersVoronoi graphobjective methodminimal spanning treeproximity graphsphere of influence graphnearest neighbours graph
Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (79)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The random minimal spanning tree in high dimensions
- The expected size of some graphs in computational geometry
- Asymptotics for Euclidean minimal spanning trees on random points
- Modern multidimensional scaling: theory and applications
- On nearest-neighbor graphs
- Probability theory of classical Euclidean optimization problems
- Graph-theoretic procedures for dimension identification
- Strong laws for Euclidean graphs with general edge weights
- Asymptotics for weighted minimal spanning trees on random points
- Asymptotics for Voronoi tessellations on random samples
- Percolation and minimal spanning trees
- The central limit theorem for weighted minimal spanning trees on random points
- Simultaneous uniqueness of infinite clusters in stationary random labeled graphs
- Limit theory for random sequential packing and deposition
- Central limit theorems for some graphs in computational geometry.
- On the number of leaves of a euclidean minimal spanning tree
- On the fraction of random points by specified nearest-neighbour interrelations and degree of attraction
- On the variance of the random sphere of influence graph
- The proportion of triangles in a Poisson-Voronoi tessellation of the plane
- Random parking, sequential adsorption, and the jamming limit
This page was built for publication: Weak laws of large numbers in geometric probability