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

DOI10.1002/rsa.21068zbMath1523.60049arXiv2105.00320OpenAlexW3209030468MaRDI QIDQ6052481

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

stabilizationStein's methodcentral limit theoremspanning treePoisson processminimal point

Mathematics Subject Classification ID

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

Related Items (2)

Upper large deviations for power-weighted edge lengths in spatial random networks ⋮ Gaussian approximation for sums of region-stabilizing scores

Cites Work

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

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