Related papers: Height and diameter of brownian tree
Upon almost-every realisation of the Brownian continuum random tree (CRT), it is possible to define a canonical diffusion process or `Brownian motion'. The main result of this article establishes that the cover time of the Brownian motion…
We study a configuration model on bipartite planar maps in which, given $n$ even integers, one samples a planar map with $n$ faces uniformly at random with these face degrees. We prove that when suitably rescaled, such maps always admit…
We present a simple yet rigorous approach to the determination of the spectral dimension of random trees, based on the study of the massless limit of the Gaussian model on such trees. As a byproduct, we obtain evidence in favor of a new…
We consider an n-dimensional Brownian Motion trapped inside a bounded convex set by normally-reflecting boundaries. It is well-known that this process is uniformly ergodic. However, the rates of this ergodicity are not well-understood,…
We consider the Brownian tree introduced by Aldous and the associated Q-process which consists in an infinite spine on which are grafted independent Brownian trees. We present a reversal procedure on these trees that consists in looking at…
The real trees form a class of metric spaces that extends the class of trees with edge lengths by allowing behavior such as infinite total edge length and vertices with infinite branching degree. Aldous's Brownian continuum random tree, the…
We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…
Over the last 30 years, researchers have investigated connections between dimension for posets and planarity for graphs. Here we extend this line of research to the structural graph theory parameter tree-width by proving that the dimension…
The metric dimension of a graph is the minimum size of a set of vertices such that each vertex is uniquely determined by the distances to the vertices of that set. Our aim is to upper-bound the order $n$ of a graph in terms of its diameter…
Tree-size distribution is one of the most investigated subjects in plant population biology. The forestry literature reports that tree-size distribution trajectories vary across different stands and/or species, while the metabolic scaling…
It is well-known that the height profile of a critical conditioned Galton-Watson tree with finite offspring variance converges, after a suitable normalization, to the local time of a standard Brownian excursion. In this work, we study the…
In a classic paper Schr\"oder posed four combinatorial problems about the number of certain types of bracketings of words and sets. Here we address what these bracketings look like on average. For each of the four problems we prove that a…
We derive several explicit distributions of functionals of Brownian motion indexed by the Brownian tree. In particular, we give a direct proof of a result of Bousquet-M\'elou and Janson identifying the distribution of the density at 0 of…
A permutation $\boldsymbol w$ gives rise to a graph $G_{\boldsymbol w}$; the vertices of $G_{\boldsymbol w}$ are the letters in the permutation and the edges of $G_{\boldsymbol w}$ are the inversions of $\boldsymbol w$. We find that the…
We consider the model of Brownian motion indexed by the Brownian tree. For every $r\geq 0$ and every connected component of the set of points where Brownian motion is greater than $r$, we define the boundary size of this component, and we…
We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…
The diameter distribution of a given species of deciduous trees in mature, temperate zone forests is well approximated by a Gamma distribution. Here we give new experimental evidence for this conjecture by analyzing deciduous tree size data…
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursive trees. In particular, we give simple new proofs of the fact that the number of fringe trees of size $ k=k_n $ in the binary search tree…
Consider a drawing of a graph $G$ in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of $G$, is the classical graph parameter "thickness". By restricting the edges to be…
Following Poupard's study of strictly ordered binary trees with respect to two parameters, namely, "end of minimal chain" and "parent of maximum leaf" a true Tree Calculus is being developed to solve a partial difference equation system and…