Related papers: The Aldous-Shields model revisited (with applicati…
In this article the results of Waddell and Azad (2009) are extended. In particular, the geometric percentage mean standard deviation measure of the fit of distances to a phylogenetic tree is adjusted for the number of parameters fitted to…
We study protected nodes in various classes of random rooted trees by putting them in the general context of fringe subtrees introduced by Aldous (1991). Several types of random trees are considered: simply generated trees (or conditioned…
Asymmetric damage segregation (ADS) is ubiquitous among unicellular organisms: After a mother cell divides, its two daughter cells receive sometimes slightly, sometimes strongly different fractions of damaged proteins accumulated in the…
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…
Growth-fragmentation processes model systems of cells that grow continuously over time and then fragment into smaller pieces. Typically, on average, the number of cells in the system exhibits asynchronous exponential growth and, upon…
An individual-based model of stochastic branching is proposed and studied, in which point particles drift in $\bar{\mathds{R}}_{+}:=[0,+\infty)$ towards the origin (edge) with unit speed, where each of them splits into two particles that…
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…
A classic problem in computational biology is constructing a phylogenetic tree given a set of distances between n species. In most cases, a tree structure is too constraining. We consider a circular split network, a generalization of a tree…
In recent years, significant progress has been made on algorithms for learning optimal decision trees, primarily in the context of binary features. Extending these methods to continuous features remains substantially more challenging due to…
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))$.…
We discuss various forms of convergence of the vicinity of a uniformly at random selected vertex in random simply generated trees, as the size tends to infinity. For the standard case of a critical Galton-Watson tree conditioned to be large…
Stanley lists the class of Dyck paths where all returns to the axis are of odd length as one of the many objects enumerated by (shifted) Catalan numbers. By the standard bijection in this context, these special Dyck paths correspond to a…
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…
A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…
The constant rate birth--death process is a popular null model for speciation and extinction. If one removes extinct and non-sampled lineages, this process induces `reconstructed trees' which describe the relationship between extant…
We investigate analytically and numerically eigenfunction statistics in a disordered system on a finite Bethe lattice (Cayley tree). We show that the wave function amplitude at the root of a tree is distributed fractally in a large part of…
We study the convergence of the predictive surface of regression trees and forests. To support our analysis we introduce a notion of adaptive concentration for regression trees. This approach breaks tree training into a model selection…
The paper introduces a PDE model for the growth of a tree stem or a vine. The equations describe the elongation due to cell growth, and the response to gravity and to external obstacles. An additional term accounts for the tendency of a…
Consider a tree $T=(V,E)$ with root $\circ$ and edge length function $\ell:E\to\mathbb{R}_+$. The phylogenetic covariance matrix of $T$ is the matrix $C$ with rows and columns indexed by $L$, the leaf set of $T$, with entries…
A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps…