Asymptotics for Euclidean minimal spanning trees on random points
From MaRDI portal
Publication:1203349
DOI10.1007/BF01194923zbMath0767.60005OpenAlexW2015610066MaRDI QIDQ1203349
David J. Aldous, J. Michael Steele
Publication date: 22 March 1993
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01194923
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)
Related Items (44)
Weak laws of large numbers in geometric probability ⋮ Limit theory for random sequential packing and deposition ⋮ Asymptotics for weighted minimal spanning trees on random points ⋮ Random oriented trees: a model of drainage networks. ⋮ Asymptotics for the Euclidean TSP with power weighted edges ⋮ Note on the structure of Kruskal's algorithm ⋮ Minimal spanning forests ⋮ Percolation of level sets for two-dimensional random fields with lattice symmetry ⋮ The central limit theorem for Euclidean minimal spanning trees. I ⋮ Limit theory for point processes in manifolds ⋮ Continuous approximation formulas for location problems ⋮ On the asymptotic growth rate of some spanning trees embedded in \(\mathbb R^d\) ⋮ Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes ⋮ Connected spatial networks over random points and a route-length statistic ⋮ A Fractal Dimension for Measures via Persistent Homology ⋮ Rate of convergence of power-weighted Euclidean minimal spanning trees ⋮ Fractal dimension estimation with persistent homology: a comparative study ⋮ Minimal spanning trees on infinite sets ⋮ Asymptotic distribution and detection thresholds for two-sample tests based on geometric graphs ⋮ Nearest neighbor inverse regression ⋮ A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms ⋮ Estimating the asymptotic constant of the total length of Euclidean minimal spanning trees with power-weighted edges. ⋮ Markov incremental constructions ⋮ Boundedness of level lines for two-dimensional random fields ⋮ The random minimal spanning tree in high dimensions ⋮ Connectivity of Random Geometric Graphs Related to Minimal Spanning Forests ⋮ Asymptotics in the random assignment problem ⋮ Near-minimal spanning trees: A scaling exponent in probability models ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ On the multivariate runs test ⋮ Recurrence or transience of random walks on random graphs generated by point processes in \(\mathbb{R}^d\) ⋮ Harry Kesten's work in probability theory ⋮ The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees ⋮ The central limit theorem for weighted minimal spanning trees on random points ⋮ Continuum percolation and Euclidean minimal spanning trees in high dimensions ⋮ On a random directed spanning tree ⋮ An average case analysis of the minimum spanning tree heuristic for the power assignment problem ⋮ Ergodic theorems for some classical problems in combinatorial optimization ⋮ Fractal dimension and the persistent homology of random geometric complexes ⋮ Quantitative two-scale stabilization on the Poisson space ⋮ Simultaneous uniqueness of infinite clusters in stationary random labeled graphs ⋮ Multivariate spatial central limit theorems with applications to percolation and spatial graphs ⋮ A greedy algorithm for finding maximum spanning trees in infinite graphs ⋮ On the consistency of the crossmatch test
Cites Work
- Asymptotic fringe distributions for general families of random trees
- Percolation theory and first-passage percolation
- Growth rates of Euclidean minimal spanning trees with power weighted edges
- Choosing a spanning tree for the integer lattice uniformly
- The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach
- An introduction to the theory of point processes
- On the number of leaves of a euclidean minimal spanning tree
- On Finding the Expected Length of a Random Minimal Tree
- Consistency of Single Linkage for High-Density Clusters
- A random tree model associated with random graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Asymptotics for Euclidean minimal spanning trees on random points
