Convergence Rate for The Number of Crossing in a Random Labelled Tree
Santiago Arenas-Velilla, Octavio Arizmendi

TL;DR
This paper proves that the number of crossings in a random labelled tree with vertices in convex position follows an asymptotically Gaussian distribution, providing a new proof and convergence rate estimate.
Contribution
It offers a new proof of the Gaussian limit law for crossings and quantifies the convergence rate to the Gaussian distribution.
Findings
Number of crossings is asymptotically Gaussian with mean n^2/6 and variance n^3/45
Convergence rate to Gaussian distribution is of order n^{-1/2}
Provides an estimate for the Kolmogorov distance to the Gaussian distribution
Abstract
We consider the number of crossings in a random labelled tree with vertices in convex position. We give a new proof of the fact that this quantity is asymptotically Gaussian with mean and variance . Furthermore, we give an estimate for the Kolmogorov distance to a Gaussian distribution which implies a convergence rate of order .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Data Management and Algorithms · Point processes and geometric inequalities
