Related papers: Mutations on a Random Binary Tree with Measured Bo…
A compacted binary tree is a graph created from a binary tree such that repeatedly occurring subtrees in the original tree are represented by pointers to existing ones, and hence every subtree is unique. Such representations form a special…
A density-dependent branching process is a particle system in which individuals reproduce independently, but in a way that depends on the current population size. This feature can model a wide range of ecological interactions at the cost of…
We study rooted planar random trees with a probability distribution which is proportional to a product of weight factors $w_n$ associated to the vertices of the tree and depending only on their individual degrees $n$. We focus on the case…
Plant differently colored points in the plane, then let random points ("Poisson rain") fall, and give each new point the color of the nearest existing point. Previous investigation and simulations strongly suggest that the colored regions…
We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only…
We study the evolution of the population genealogy in the classic neutral Moran Model of finite size and in discrete time. The stochastic transformations that shape a Moran population can be realized directly on its genealogy and give rise…
We investigate the genealogy of a sample of $k\geq1$ particles chosen uniformly without replacement from a population alive at large times in a critical discrete-time Galton-Watson process in a varying environment (GWVE). We will show that…
We provide a new approach for proving the indistinguishability of connected components of random one-or-two-ended oriented forests on unimodular random graphs. In particular, this approach leads to a new and simpler proof for the wired…
We propose a novel algorithm for optimizing multivariate linear threshold functions as split functions of decision trees to create improved Random Forest classifiers. Standard tree induction methods resort to sampling and exhaustive search…
Decision tree learning is increasingly being used for pointwise inference. Important applications include causal heterogenous treatment effects and dynamic policy decisions, as well as conditional quantile regression and design of…
We consider a random forest $\mathcal{F}^*$, defined as a sequence of i.i.d. birth-death (BD) trees, each started at time 0 from a single ancestor, stopped at the first tree having survived up to a fixed time $T$. We denote by…
We study coalescent processes conditional on the population pedigree under the exchangeable diploid bi-parental population model of \citet{BirknerEtAl2018}. While classical coalescent models average over all reproductive histories, thereby…
In this paper, we consider the evolution of an (infinitely large) population under recombination and additional evolutionary forces, modelled by a measure-valued ordinary differential equation. We provide a stochastic representation for the…
In this paper we show that all infinite trees which have bounded coordination and whose surface is negligible with respect to the volume in the limit of large distances (so that they can be embedded in a finite-dimensional euclidean space)…
We consider a one-dimensional dyadic branching Brownian motion on $\mathbb{R}$ with positive drift $\beta \in (0,1)$, branching rate $1/2$, reflected at $0$ and killed at a boundary $L > 0$. The killing boundary $L$ is chosen so that the…
We consider a natural destruction process of an infinite recursive tree by removing each edge after an independent exponential time. The destruction up to time t is encoded by a partition $\Pi$(t) of N into blocks of connected vertices.…
We show that for many models of random trees, the independence number divided by the size converges almost surely to a constant as the size grows to infinity; the trees that we consider include random recursive trees, binary and $m$-ary…
We study branching diffusions in a bounded domain $D$ of $\mathbb{R}^d$ in which particles are killed upon hitting the boundary $\partial D$. It is known that any such process undergoes a phase transition when the branching rate $\beta$…
This paper studies the entropy of tree-shifts of finite type with and without boundary conditions. We demonstrate that computing the entropy of a tree-shift of finite type is equivalent to solving a system of nonlinear recurrence equations.…
The ongoing explosion of genome sequence data is transforming how we reconstruct and understand the histories of biological systems. Across biological scales, from individual cells to populations and species, trees-based models provide a…