A strong law for the longest edge of the minimal spanning tree
From MaRDI portal
Publication:1807193
DOI10.1214/aop/1022677261zbMath0944.60015OpenAlexW2032643924MaRDI QIDQ1807193
Publication date: 9 November 1999
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1022677261
Geometric probability and stochastic geometry (60D05) Extreme value theory; extremal stochastic processes (60G70) Strong limit theorems (60F15)
Related Items (17)
Efficiency of the pMST and RDELA location and scatter estimators ⋮ Degree distribution of the FKP network model ⋮ Note on the structure of Kruskal's algorithm ⋮ Unnamed Item ⋮ Robust estimation of location and scatter by pruning the minimum spanning tree ⋮ Unnamed Item ⋮ A Fractal Dimension for Measures via Persistent Homology ⋮ A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree. ⋮ Set estimation and nonparametric detection ⋮ On the connectivity threshold for general uniform metric spaces ⋮ On the fundamental limits of topology control in ad hoc networks ⋮ When does the union of random spherical caps become connected? ⋮ A graph-based estimator of the number of clusters ⋮ Probabilistic connectivity threshold for directional antenna widths ⋮ Probabilistic Connectivity Threshold for Directional Antenna Widths ⋮ Continuum limit of total variation on point clouds ⋮ The connectivity of a graph on uniform points on [0,\,1\(^{d}\).]
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The longest edge of the random minimal spanning tree
- Extremes for the minimal spanning tree on normally distributed points
- The Minimum Vertex Degree of a Graph on Uniform Points in [0, 1d]
- A Strong Law for the Largest Nearest-Neighbour Link between Random Points
- Cell Growth Problems
This page was built for publication: A strong law for the longest edge of the minimal spanning tree
