Related papers: Regenerative tree growth: structural results and c…
We introduce a simple tree growth process that gives rise to a new two-parameter family of discrete fragmentation trees that extends Ford's alpha model to multifurcating trees and includes the trees obtained by uniform sampling from…
We use a natural ordered extension of the Chinese Restaurant Process to grow a two-parameter family of binary self-similar continuum fragmentation trees. We provide an explicit embedding of Ford's sequence of alpha model trees in the…
Given any regularly varying dislocation measure, we identify a natural self-similar fragmentation tree as scaling limit of discrete fragmentation trees with unit edge lengths. As an application, we obtain continuum random tree limits of…
We study (plane) tree-valued Markov chains $(T_n,n \geq 1)$ with uniform backward dynamics and show that they can be obtained by sampling from a real tree. As non--plane trees, every such Markov chain is represented by a weighted real tree.…
We introduce a non-increasing tree growth process $((T_n,\sigma_n),\, n\ge 1)$, where $T_n$ is a rooted labeled tree on $n$ vertices and ${\sigma}_n$ is a permutation of the vertex labels. The construction of $(T_{n},{\sigma}_n)$ from…
Markovian growth-fragmentation processes introduced by Bertoin model a system of growing and splitting cells in which the size of a typical cell evolves as a Markov process $X$ without positive jumps. We find that two growth-fragmentation…
We introduce the notion of a restricted exchangeable partition of $\mathbb{N}$. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In…
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…
In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…
In this paper, we propose to study a general notion of a down-up Markov chain for multifurcating trees with n labelled leaves. We study in detail down-up chains associated with the $(\alpha, \gamma)$-model of Chen et al. (2009),…
In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…
Self-similar Markov trees constitute a remarkable family of random compact real trees carrying a decoration function that is positive on the skeleton. As the terminology suggests, they are self-similar objects that further satisfy a Markov…
Consider a Markov chain on an infinite tree T=(V,E) rooted at \rho. In such a chain, once the initial root state \sigma(\rho) is chosen, each vertex iteratively chooses its state from the one of its parent by an application of a Markov…
We examine a discrete random recursive tree growth process that, at each time step, either adds or deletes a node from the tree with probability $p$ and $1-p$, respectively. Node addition follows the usual uniform attachment model. For node…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
We establish necessary and sufficient conditions for consistent root reconstruction in continuous-time Markov models with countable state space on bounded-height trees. Here a root state estimator is said to be consistent if the probability…
We consider Galton--Watson trees conditioned on both the total number of vertices $n$ and the number of leaves $k$. The focus is on the case in which both $k$ and $n$ grow to infinity and $k = \alpha n + O(1)$, with $\alpha \in (0, 1)$.…
The spread of infectious disease in a human community or the proliferation of fake news on social media can be modeled as a randomly growing tree-shaped graph. The history of the random growth process is often unobserved but contains…
We consider a fragmentation of discrete trees where the internal vertices are deleted independently at a rate proportional to their degree. Informally, the associated cut-tree represents the genealogy of the nested connected components…
We introduce a notion of finite sampling consistency for phylogenetic trees and show that the set of finitely sampling consistent and exchangeable distributions on n leaf phylogenetic trees is a polytope. We use this polytope to show that…