Gaussian approximation for rooted edges in a random minimal directed spanning tree

DOI10.1002/RSA.21068MaRDI QIDQ6052481zbMATH OpenOpenAlexFDO

Authors Chinmoy Bhattacharjee

Publication date 17 October 2023

Published in Random Structures \& Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

central limit theoremminimal pointPoisson processspanning treestabilizationStein's method

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05)

Abstract: We study the total $alpha$-powered length of the rooted edges in a random minimal directed spanning tree - first introduced in Bhatt and Roy (2004) - on a Poisson process with intensity $sge1$ on the unit cube $[0,1{]}^d$ for $dge3$. While a Dickman limit was proved in Penrose and Wade (2004) in the case of $d=2$, in dimensions three and higher, Bai, Lee and Penrose (2006) showed a Gaussian central limit theorem when $alpha=1$, with a rate of convergence of the order $(logs{)}^{-(d-2)/4}(loglogs{)}^{(d+1)/2}$. In this paper, we extend these results and prove a central limit theorem in any dimension $dge3$ for any $alpha>0$. Moreover, making use of recent results in Stein's method for region-stabilizing functionals, we provide presumably optimal non-asymptotic bounds of the order $(logs{)}^{-(d-2)/2}$ on the Wasserstein and the Kolmogorov distances between the distribution of the total $alpha$-powered length of rooted edges, suitably normalized, and that of a standard Gaussian random variable.

Recommendations

• Rooted edges of a minimal directed spanning tree on random points
• Random minimal directed spanning trees and Dickman-type distributions
• On the total length of the random minimal directed spanning tree
• The central limit theorem for Euclidean minimal spanning trees II
• Central limit theorems for the radial spanning tree

Cites work

• Central limit theorems for some graphs in computational geometry.
• Limit theorems for random spatial drainage networks
• Maxima in hypercubes
• Normal approximation for random sums
• Normal approximation for stabilizing functionals
• On a random directed spanning tree
• On the total length of the random minimal directed spanning tree
• Random minimal directed spanning trees and Dickman-type distributions
• Random Plane Networks
• Rooted edges of a minimal directed spanning tree on random points
• Supporting-points processes and some of their applications
• Surface order scaling in stochastic geometry
• The Pareto record frontier
• Weak laws of large numbers in geometric probability

Cited in

(4)

• Gaussian approximation for sums of region-stabilizing scores
• Rooted edges of a minimal directed spanning tree on random points
• Upper large deviations for power-weighted edge lengths in spatial random networks
• Quantitative CLTs on the Poisson space via Skorohod estimates and p-Poincaré inequalities

This page was built for publication: Gaussian approximation for rooted edges in a random minimal directed spanning tree

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