Extremes on trees

DOI10.1214/009117904000001008zbMath1096.60009arXivmath/0503603OpenAlexW3105581133MaRDI QIDQ2497218

Tailen Hsing, Holger Rootzén

Publication date: 3 August 2006

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

Full work available at URL: https://arxiv.org/abs/math/0503603

zbMATH Keywords

extreme valuesminimal spanning treenearest neighbour graph

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Extreme value theory; extremal stochastic processes (60G70)

Related Items

Homological connectivity in random Čech complexes, Nonuniform random geometric graphs with location-dependent radii, Inhomogeneous random graphs, isolated vertices, and Poisson approximation, Isolation and connectivity in random geometric graphs with self-similar intensity measures, Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs, Vertex degree of random geometric graph on exponentially distributed points

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremes and related properties of random sequences and processes
• The longest edge of the random minimal spanning tree
• The central limit theorem for Euclidean minimal spanning trees. I
• Central limit theorems for \(k\)-nearest neighbour distances
• The central limit theorem for weighted minimal spanning trees on random points
• Extremes for the minimal spanning tree on normally distributed points