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}$.Comment: 9 pages. arXiv admin note: text overlap with arXiv:2205.0399
Consider a nearest neighbour random walk $X_n$ on the $d$-regular tree $\T_d$, where $d\geq 3$, cond...
International audienceModels of random walks in a random environment were intro- duced at first by C...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of ...
We show that the range of a critical branching random walk conditioned to survive forever and the Mi...
In this extended abstract a general framework is developed to bound rates of convergence for sequenc...
In this work, we are interested in the set of visited vertices of a tree $\mathbb{T}$ by a randomly ...
We study the asymptotic behavior af the number of cuts $X(T_n)$ needed to isolate the root in a root...
40 pagesInternational audienceWe are interested in the biased random walk on a supercritical Galton-...
dissertationThis dissertation contains the solutions to two problems. The first problem concerns pro...
We consider Galton--Watson trees conditioned on both the total number of vertices $n$ and the number...
We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition pr...
Within the last thirty years, the contraction method has become an important tool for the distributi...
Here we consider two parameters for random non-crossing trees: $\textit{(i)}$ the number of random c...
We prove limit theorems describing the asymptotic behaviour of a typical vertex in random simply gen...
AbstractWe study the quantity distance between node j and node n in a random tree of size n chosen f...
Consider a nearest neighbour random walk $X_n$ on the $d$-regular tree $\T_d$, where $d\geq 3$, cond...
International audienceModels of random walks in a random environment were intro- duced at first by C...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of ...
We show that the range of a critical branching random walk conditioned to survive forever and the Mi...
In this extended abstract a general framework is developed to bound rates of convergence for sequenc...
In this work, we are interested in the set of visited vertices of a tree $\mathbb{T}$ by a randomly ...
We study the asymptotic behavior af the number of cuts $X(T_n)$ needed to isolate the root in a root...
40 pagesInternational audienceWe are interested in the biased random walk on a supercritical Galton-...
dissertationThis dissertation contains the solutions to two problems. The first problem concerns pro...
We consider Galton--Watson trees conditioned on both the total number of vertices $n$ and the number...
We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition pr...
Within the last thirty years, the contraction method has become an important tool for the distributi...
Here we consider two parameters for random non-crossing trees: $\textit{(i)}$ the number of random c...
We prove limit theorems describing the asymptotic behaviour of a typical vertex in random simply gen...
AbstractWe study the quantity distance between node j and node n in a random tree of size n chosen f...
Consider a nearest neighbour random walk $X_n$ on the $d$-regular tree $\T_d$, where $d\geq 3$, cond...
International audienceModels of random walks in a random environment were intro- duced at first by C...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of ...