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 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 n1/2.










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)