The random minimal spanning tree in high dimensions

DOI10.1214/AOP/1041903210zbMath0866.60021OpenAlexW2037889639MaRDI QIDQ674507

Mathew D. Penrose

Publication date: 8 July 1997

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1041903210

zbMATH Keywords

invasion percolationcontinuum percolationminimal spanning treegeometric probabilityvertex degrees

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Trees (05C05) Combinatorial optimization (90C27)

Related Items (11)

Weak laws of large numbers in geometric probability ⋮ Asymptotics for weighted minimal spanning trees on random points ⋮ The scaling limits of the minimal spanning tree and invasion percolation in the plane ⋮ The central limit theorem for Euclidean minimal spanning trees. I ⋮ Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes ⋮ Rate of convergence of power-weighted Euclidean minimal spanning trees ⋮ First-order optimality condition of basis pursuit denoise problem ⋮ Multiscale Methods for Data on Graphs and Irregular Multidimensional Situations ⋮ Resistant estimation of multivariate location using minimum spanning trees ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ On the multivariate runs test

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
• Graph-theoretic measures of multivariate association and prediction
• Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
• The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach
• Asymptotics for Euclidean minimal spanning trees on random points
• On the spread-out limit for bond and continuum percolation
• The central limit theorem for weighted minimal spanning trees on random points
• Continuum percolation and Euclidean minimal spanning trees in high dimensions
• Percolation and minimal spanning forests in infinite graphs
• Nearest neighbors and Voronoi regions in certain point processes
• The supercritical phase of percolation is well behaved
• Mutual and shared neighbor probabilities: finite- and infinite-dimensional results
• On the number of leaves of a euclidean minimal spanning tree
• A random tree model associated with random graphs
• Generalization of the Gap Test for the Detection of Multivariate Outliers
• Storage Reduction Through Minimal Spanning Trees and Spanning Forests
• Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
• Equality of critical densities in continuum percolation

This page was built for publication: The random minimal spanning tree in high dimensions