Convergence rate for the number of crossings in a random labelled tree

DOI10.1016/J.SPL.2023.109916zbMATH Open1523.60046arXiv2209.09431OpenAlexW4385651993MaRDI QIDQ6084751FDOQ6084751

Authors: Santiago Arenas-Velilla, Octavio Arizmendi 

Publication date: 6 November 2023

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

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 $n^2/6$ and variance $n^3/45$. Furthermore, we give an estimate for the Kolmogorov distance to a Gaussian distribution which implies a convergence rate of order $n^{-1/2}$.

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

Recommendations

• Normal convergence problem? Two moments and a recurrence may be the clues
• The shape of unlabeled rooted random trees
• The continuum random tree. I
• scientific article; zbMATH DE number 2197876
• Large deviations of the height of a random tree

zbMATH Keywords

normal approximationcrossingsrandom labelled trees

Mathematics Subject Classification ID

Asymptotic distribution theory in statistics (62E20) Central limit and other weak theorems (60F05) Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05)

Cites Work

• Normal Approximation by Stein’s Method
• Title not available (Why is that?)
• Fundamentals of Stein's method
• Multivariate normal approximations by Stein's method and size bias couplings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A central limit theorem for descents of a Mallows permutation and its inverse

This page was built for publication: Convergence rate for the number of crossings in a random labelled tree

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