Related papers: Growing Self-Similar Markov Trees
Aldous, Evans and Pitman (1998) studied the behavior of the fragmentation process derived from deleting the edges of a uniform random tree on $n$ labelled vertices. In particular, they showed that, after proper rescaling, the above…
We are interested in the cycles obtained by slicing at all heights random Boltzmann triangulations with a simple boundary. We establish a functional invariance principle for the lengths of these cycles, appropriately rescaled, as the size…
The purpose of the present work is twofold. First, we develop the theory of general self-similar growth-fragmentation processes by focusing on martingales which appear naturally in this setting and by recasting classical results for…
We study properties of the random metric space called the Brownian map. For every h>0, we consider the connected components of the complement of the open ball of radius h centered at the root, and we let N(h,r) be the number of those…
Starting from any graph on $\{1, \ldots, n\}$, consider the Markov chain where at each time-step a uniformly chosen vertex is disconnected from all of its neighbors and reconnected to another uniformly chosen vertex. This Markov chain has a…
We embed Duquesne and Le Gall's stable tree into a binary compact continuum random tree (CRT) in a way that solves an open problem posed by Goldschmidt and Haas. This CRT can be obtained by applying a recursive construction method of…
The bijection between composition structures and random closed subsets of the unit interval implies that the composition structures associated with $S \cap [0,1]$ for a self-similar random set $S\subset {\mathbb R}_+$ are those which are…
We introduce block Markov chains (BMCs) indexed by an infinite rooted tree. It turns out that BMCs define a new class of tree-indexed Markovian processes. We clarify the structure of BMCs in connection with Markov chains (MCs) and Markov…
Phylogenetic trees describe the relationships between species in the evolutionary process, and provide information about the rates of diversification. To understand the mechanisms behind macroevolution, we consider a class of multitype…
Bassino et al. (arXiv:1907.08517) have shown that uniform random co-graphs (graphs without induced $P_4$) of size $n$ converge to a certain non-deterministic graphon. The edge-density of this graphon is a random variable $\Lambda \in [0,1]$…
Search trees on trees (STTs) are a far-reaching generalization of binary search trees (BSTs), allowing the efficient exploration of tree-structured domains. (BSTs are the special case in which the underlying domain is a path.) Trees on…
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 study marginally compact macromolecular trees that are created by means of two different fractal generators. In doing so, we assume Gaussian statistics for the vectors connecting nodes of the trees. Moreover, we introduce bond-bond…
We study the asymptotic behaviour of uniform random maps with a prescribed face-degree sequence, in the bipartite case, as the number of faces tends to infinity. Under mild assumptions, we show that, properly rescaled, such maps converge in…
Given a general critical or sub-critical branching mechanism, we define a pruning procedure of the associated L\'evy continuum random tree. This pruning procedure is defined by adding some marks on the tree, using L\'evy snake techniques.…
Splitting trees are those random trees where individuals give birth at constant rate during a lifetime with general distribution, to i.i.d. copies of themselves. The width process of a splitting tree is then a binary, homogeneous…
Given $n \in \mathbb{N}$ and $\mu \in \mathbb{R}$, a $\textit{$\mu$-height-biased tree of size $n$}$ is a random plane tree $\mathbf{\mathbf{T}}_n$ with $n$ vertices with law given by $\mathbb{P}(\mathbf{T}=t) \propto e^{-\mu h(t)}$, where…
Random critical branching trees (CBTs) are generated by the multiplicative branching process, where the branching number is determined stochastically, independent of the degree of their ancestor. Here we show analytically that despite this…
We introduce an algorithm for generating a random sequence of fragmentation trees, which we call the ancestral branching algorithm. This algorithm builds on the recursive partitioning structure of a tree and gives rise to an associated…
We are interested in the asymptotics of random trees built by linear preferential attachment, also known in the literature as Barab\'asi-Albert trees or plane-oriented recursive trees. We first prove a conjecture of Bubeck, Mossel \& R\'acz…