Convergence rate for the number of crossings in a random labelled tree
From MaRDI portal
Publication:6084751
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 .
Recommendations
Cites work
- scientific article; zbMATH DE number 3156743 (Why is no real title available?)
- scientific article; zbMATH DE number 4155658 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 1504583 (Why is no real title available?)
- A central limit theorem for descents of a Mallows permutation and its inverse
- Fundamentals of Stein's method
- Multivariate normal approximations by Stein's method and size bias couplings
- Normal Approximation by Stein’s Method
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)