Extremes on trees

DOI10.1214/009117904000001008MaRDI QIDQ2497218zbMATH OpenOpenAlexFDO

Authors 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

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

Abstract: This paper considers the asymptotic distribution of the longest edge of the minimal spanning tree and nearest neighbor graph on X_1,...,X_{N_n} where X_1,X_2,... are i.i.d. in Re^2 with distribution F and N_n is independent of the X_i and satisfies N_n/n o_p1. A new approach based on spatial blocking and a locally orthogonal coordinate system is developed to treat cases for which F has unbounded support. The general results are applied to a number of special cases, including elliptically contoured distributions, distributions with independent Weibull-like margins and distributions with parallel level curves.

Recommendations

• Extremes for the minimal spanning tree on normally distributed points
• The longest edge of the random minimal spanning tree
• Inapplicability of asymptotic results on the minimal spanning tree in statistical testing
• scientific article; zbMATH DE number 912696
• Random minimal directed spanning trees and Dickman-type distributions

Cites work

• Central limit theorems for \(k\)-nearest neighbour distances
• Extremes and related properties of random sequences and processes
• Extremes for the minimal spanning tree on normally distributed points
• scientific article; zbMATH DE number 3117699 (Why is no real title available?)
• scientific article; zbMATH DE number 3866301 (Why is no real title available?)
• scientific article; zbMATH DE number 4000257 (Why is no real title available?)
• scientific article; zbMATH DE number 3349105 (Why is no real title available?)
• The central limit theorem for Euclidean minimal spanning trees. I
• The central limit theorem for weighted minimal spanning trees on random points
• The longest edge of the random minimal spanning tree

Cited in

(12)

• The longest edge of the random minimal spanning tree
• Isolation and connectivity in random geometric graphs with self-similar intensity measures
• Inapplicability of asymptotic results on the minimal spanning tree in statistical testing
• Homological connectivity in random Čech complexes
• Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs
• Extremes for the minimal spanning tree on normally distributed points
• Inhomogeneous random graphs, isolated vertices, and Poisson approximation
• scientific article; zbMATH DE number 912696 (Why is no real title available?)
• Fluctuations of the connectivity threshold and largest nearest-neighbour link
• Nonuniform random geometric graphs with location-dependent radii
• Vertex degree of random geometric graph on exponentially distributed points
• Trees and extensive forms

This page was built for publication: Extremes on trees

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