The random minimal spanning tree in high dimensions

DOI10.1214/AOP/1041903210MaRDI QIDQ674507zbMATH OpenOpenAlexFDO

Authors 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

continuum percolationgeometric probabilityminimal spanning treeinvasion percolationvertex degrees

Mathematics Subject Classification ID

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

Recommendations

• Tail bound for the minimal spanning tree of a complete graph.
• Asymptotics for Euclidean minimal spanning trees on random points
• On the number of leaves of a euclidean minimal spanning tree
• The central limit theorem for Euclidean minimal spanning trees. I

Cites work

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

Cited in

(22)

• scientific article; zbMATH DE number 1750458 (Why is no real title available?)
• Cube versus torus models and the Euclidean minimum spanning tree constant
• scientific article; zbMATH DE number 1805832 (Why is no real title available?)
• On the multivariate runs test
• Rate of convergence of power-weighted Euclidean minimal spanning trees
• Weak laws of large numbers in geometric probability
• The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach
• Degree Frequencies in the Minimal Spanning Tree and Dimension Identification
• The central limit theorem for Euclidean minimal spanning trees. I
• Asymptotics for Euclidean minimal spanning trees on random points
• Multiscale methods for data on graphs and irregular multidimensional situations
• Rooted edges of a minimal directed spanning tree on random points
• Tail bound for the minimal spanning tree of a complete graph.
• Geometry of the minimal spanning tree of a random 3-regular graph
• First-order optimality condition of basis pursuit denoise problem
• Resistant estimation of multivariate location using minimum spanning trees
• RANDOM HYPERPLANE SEARCH TREES IN HIGH DIMENSIONS
• Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
• On minimum spanning trees for random Euclidean bipartite graphs
• Asymptotics for weighted minimal spanning trees on random points
• scientific article; zbMATH DE number 1123759 (Why is no real title available?)
• The scaling limits of the minimal spanning tree and invasion percolation in the plane

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674507)