Related papers: Regenerative tree growth: structural results and c…
We study a class of Markovian systems of $N$ elements taking values in $[0,1]$ that evolve in discrete time $t$ via randomized replacement rules based on the ranks of the elements. These rank-driven processes are inspired by variants of the…
The evolution of aligned DNA sequence sites is generally modeled by a Markov process operating along the edges of a phylogenetic tree. It is well known that the probability distribution on the site patterns at the tips of the tree…
We show that the structure of a growing tree preserves an information on the shape of an initial graph. For the exponential trees, evidence of this kind of memory is provided by means of the iterative equations, derived for the moments of…
Consider an information source generating a symbol at the root of a tree network whose links correspond to noisy communication channels, and broadcasting it through the network. We study the problem of reconstructing the transmitted symbol…
In this paper we consider two continuous-mass population models as analogues of logistic branching random walks, one is supported on a finite trait space and the other one is supported on an infinite trait space. For the first model with…
A degree sequence is a sequence ${\bf s}=(N_i,i\geq 0)$ of non-negative integers satisfying $1+\sum_i iN_i=\sum_i N_i<\infty$. We are interested in the uniform distribution $\mathbb{P}_{{\bf s}}$ on rooted plane trees whose degree sequence…
This paper studies a Markov chain for phylogenetic reconstruction which uses a popular transition between tree topologies known as subtree pruning-and-regrafting (SPR). We analyze the Markov chain in the simpler setting that the generating…
In this article, we study a simple random walk on a decorated Galton-Watson tree, obtained from a Galton-Watson tree by replacing each vertex of degree $n$ with an independent copy of a graph $G_n$ and gluing the inserted graphs along the…
We derive tractable criteria for the consistency of Bayesian tree reconstruction procedures, which constitute a central class of algorithms for inferring common ancestry among DNA sequence samples in phylogenetics. Our results encompass…
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…
We study certain consistent families $(F_\lambda)_{\lambda\ge 0}$ of Galton-Watson forests with lifetimes as edge lengths and/or immigrants as progenitors of the trees in $F_\lambda$. Specifically, consistency here refers to the property…
We examine to what extent the tempo and mode of environmental fluctuations matter for the growth of structured populations. The models are switching, linear ordinary differential equations $x'(t)=A(\sigma(\omega t))x(t)$ where…
Motivated by the study of random temporal networks, we introduce a class of random trees that we coin \emph{uniform temporal trees}. A uniform temporal tree is obtained by assigning independent uniform $[0,1]$ labels to the edges of a…
In order to study the statistics of the objects with hierarchical merging, we propose the skeleton tree formalism, which can analytically distinguish the episodic merging and the continuous accretion in the mass growth processes. The…
The reconstruction of transmission trees for epidemics from genetic data has been the subject of some recent interest. It has been demonstrated that the transmission tree structure can be investigated by augmenting internal nodes of a…
A regenerative composition structure is a sequence of ordered partitions derived from the range of a subordinator by a natural sampling procedure. In this paper, we extend previous studies Barbour and Gnedin (2006), Gnedin, Iksanov and…
We investigate the mixed spin-$(s,\tfrac12)$ Ising model on a Cayley tree of order three ($k=3$), extending the approach of \cite{Akin2024}. For the representative case $s=5$, the associated recursion leads to an 11-dimensional dynamical…
In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general…
Many processes and models --in biological, physical, social, and other contexts-- produce trees whose depth scales logarithmically with the number of leaves. Phylogenetic trees, describing the evolutionary relationships between biological…
Dynamic regression trees are an attractive option for automatic regression and classification with complicated response surfaces in on-line application settings. We create a sequential tree model whose state changes in time with the…