Related papers: SPDE Approximation for Random Trees
A symbolic-computational algorithm, fully implemented in Maple, is described, that computes explicit expressions for generating functions that enable the efficient computations of the expectation, variance, and higher moments, of the random…
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…
Given a gene-tree labeled topology $G$ and a species tree $S$, the "ancestral configurations" at an internal node $k$ of $S$ represent the combinatorially different sets of gene lineages that can be present at $k$ when all possible…
We analyze a class of spatial random spanning trees built on a realization of a homogeneous Poisson point process of the plane. This tree has a simple radial structure with the origin as its root. We first use stochastic geometry arguments…
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…
We discuss several connections between discrete and continuous random trees. In the discrete setting, we focus on Galton-Watson trees under various conditionings. In particular, we present a simple approach to Aldous' theorem giving the…
The goal of this work is to decompose random populations with a genealogy in subfamilies of a given degree of kinship and to obtain a notion of infinitely divisible genealogies. We model the genealogical structure of a population by…
A large class of phylogenetic networks can be obtained from trees by the addition of horizontal edges between the tree edges. These networks are called tree based networks. Reticulation-visible networks and child-sibling networks are all…
The probability that two randomly selected phylogenetic trees of the same size are isomorphic is found to be asymptotic to a decreasing exponential modulated by a polynomial factor. The number of symmetrical nodes in a random phylogenetic…
Joint distributions over many variables are frequently modeled by decomposing them into products of simpler, lower-dimensional conditional distributions, such as in sparsely connected Bayesian networks. However, automatically learning such…
We study the minimal spanning arborescence which is the directed analogue of the minimal spanning tree, with a particular focus on its infinite volume limit and its geometric properties. We prove that in a certain large class of transient…
Monotone trees - trees with a function defined on their vertices that decreases the further away from a root node one travels, are a natural model for a process that weakens the further one gets from its source. Given an aggregation of…
As researchers collect increasingly large molecular data sets to reconstruct the Tree of Life, the heterogeneity of signals in the genomes of diverse organisms poses challenges for traditional phylogenetic analysis. A class of phylogenetic…
Consider a stationary sequence $X=(X_n)$ of integer-valued random variables with mean $m \in [-\infty, \infty]$. Let $S=(S_n)$ be the stochastic process with increments $X$ and such that $S_0=0$. For each time $i$, draw an edge from…
Motivated by online recommendation systems, we study a family of random forests. The vertices of the forest are labeled by integers. Each non-positive integer $i\le 0$ is the root of a tree. Vertices labeled by positive integers $n \ge 1$…
We introduce a model of tree-rooted planar maps weighted by their number of $2$-connected blocks. We study its enumerative properties and prove that it undergoes a phase transition. We give the distribution of the size of the largest…
The purpose of this paper is to analyze certain statistics of a recently introduced non-uniform random tree model, biased recursive trees. This model is based on constructing a random tree by establishing a correspondence with non-uniform…
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…
The recently discovered correspondence between the distribution of rapidity gaps in electron-nucleus diffractive processes and the statistics of the height of genealogical trees in branching random walks is reviewed. In addition, a new…
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…