Convergence Rate for The Number of Crossing in a Random Labelled Tree
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 n2/6 and variance n3/45. Furthermore, we give an estimate for the Kolmogorov distance to a Gaussian distribution which implies a convergence rate of order n-1/2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.