Related papers: Decomposition of Levy trees along their diameter

We consider the model of random trees introduced by Devroye (1999), the so-called random split trees. The model encompasses many important randomized algorithms and data structures. We then perform supercritical Bernoulli bond-percolation…

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…

What is the analogue of L\'evy processes for random surfaces? Motivated by scaling limits of random planar maps in random geometry, we introduce and study L\'evy looptrees and L\'evy maps. They are defined using excursions of general L\'evy…

We study various models of random non-crossing configurations consisting of diagonals of convex polygons, and focus in particular on uniform dissections and non-crossing trees. For both these models, we prove convergence in distribution…

This work builds upon the recent monograph [5] on self-similar Markov trees. A self-similar Markov tree is a random real tree equipped with a function from the tree to $[0,\infty)$ that we call the decoration. Here, we construct local time…

We give a new, simple construction of the $\alpha$-stable tree for $\alpha \in (1,2]$. We obtain it as the closure of an increasing sequence of $\mathbb{R}$-trees inductively built by gluing together line-segments one by one. The lengths of…

Panagiotou and Stufler (arXiv:1502.07180v2) recently proved one important fact on their way to establish the scaling limits of random P\'{o}lya trees: a uniform random P\'{o}lya tree of size $n$ consists of a conditioned critical…

Conditional independence and graphical models are crucial concepts for sparsity and statistical modeling in higher dimensions. For L\'evy processes, a widely applied class of stochastic processes, these notions have not been studied. By the…

We study the behaviour of the rescaled minimal subtree containing the origin and K random vertices selected from a random critical (sufficiently spread-out, and in dimensions d > 8) lattice tree conditioned to survive until time ns, in the…

We study a new type of random minimum spanning trees. It is built on the complete graph where each vertex is given a weight, which is a positive real number. Then, each edge is given a capacity which is a random variable that only depends…

Inspired by Stufler's recent probabilistic proof of Otter's asymptotic number of unlabeled trees, we revisit work of Palmer and Schwenk, and study unlabeled forests from a probabilistic point of view. We show that the number of trees in a…

We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…

Using the theory of free random variables (FRV) and the Coulomb gas analogy, we construct stable random matrix ensembles that are random matrix generalizations of the classical one-dimensional stable L\'{e}vy distributions. We show that 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…

We study the size of the automorphism group of two different types of random trees: Galton--Watson trees and rooted P\'olya trees. In both cases, we prove that it asymptotically follows a log-normal distribution and provide asymptotic…

We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to the local time of a standard Brownian excursion. Furthermore…

In this work, we give a description of all sigma-finite measures on the space of rooted compact real trees which satisfy a certain regenerative property. We show that any infinite measure which satisfies the regenerative property is the…

We study the average height of random trees generated by leaf-centric binary tree sources as introduced by Zhang, Yang and Kieffer. A leaf-centric binary tree source induces for every $n \geq 2$ a probability distribution on the set of…

We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It also generalises some recent results on the number of…

We consider Bienaym\'e-Galton-Watson trees in random environment, where each generation $k$ is attributed a random offspring distribution $\mu_k$, and $(\mu_k)_{k\geq 0}$ is a sequence of independent and identically distributed random…