Related papers: Sufficient condition for root reconstruction by pa…
For a generalized continuous state branching process with non-vanishing diffusion part, finite expectation and a directed ("left-to-right") interaction, we construct the height process of its forest of genealogical trees. The connection…
We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…
We introduce a new model of random tree that grows like a random recursive tree, except at some exceptional "doubling events" when the tree is replaced by two copies of itself attached to a new root. We prove asymptotic results for the size…
In multivariate data analysis, it is often important to estimate a graph characterizing dependence among (p) variables. A popular strategy uses the non-zero entries in a (p\times p) covariance or precision matrix, typically requiring…
We calculate the probability distribution of repetitions of ancestors in a genealogical tree for simple neutral models of a closed population with sexual reproduction and non-overlapping generations. Each ancestor at generation g in the…
Given a Galton-Watson process conditioned to have total progeny equal to $n$, we study the asymptotic probability that this conditioned Galton-Watson process has distance to the border bigger or equal than $k$, as the number of nodes $n…
The reconstruction of phylogenetic trees from discrete character data typically relies on models that assume the characters evolve under a continuous-time Markov process operating at some overall rate $\lambda$. When $\lambda$ is too high…
We present convincing empirical evidence for an effective and general strategy for building accurate small models. Such models are attractive for interpretability and also find use in resource-constrained environments. The strategy is to…
We consider planar rooted random trees whose distribution is even for fixed height $h$ and size $N$ and whose height dependence is of exponential form $e^{-\mu h}$. Defining the total weight for such trees of fixed size to be $Z^{(\mu)}_N$,…
We study a general model of recursive trees where vertices are equipped with independent weights and at each time-step a vertex is sampled with probability proportional to its fitness function (a function of its weight and degree) and…
We study random two-dimensional spanning forests in the plane that can be viewed both in the discrete case and in their appropriately taken scaling limits as a uniformly chosen spanning tree with some Poissonian deletion of edges or points.…
It is known that the size of the largest common subtree (i.e., the maximum agreement subtree) of two independent random binary trees with $n$ given labeled leaves is of order between $n^{0.366}$ and $n^{1/2}$. We improve the lower bound to…
Due to the interconnectedness of financial entities, estimating certain key properties of a complex financial system (e.g. the implied level of systemic risk) requires detailed information about the structure of the underlying network.…
A variety of algorithms have been proposed for reconstructing trees that show the evolutionary relationships between species by comparing differences in genetic data across present-day taxa. If the leaf-to-leaf distances in a tree can be…
We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the DGM net. The recursions allow for many large-scale properties…
For different reversible Markov kernels on finite state spaces, we look for families of probability measures for which the time evolution almost remains in their convex hull. Motivated by signal processing problems and metastability studies…
We present a computational model to reconstruct trees of ancestors for animals with sexual reproduction. Through a recursive algorithm combined with a random number generator, it is possible to reproduce the number of ancestors for each…
Trees in Brownian excursions have been studied since the late 1980s. Forests in excursions of Brownian motion above its past minimum are a natural extension of this notion. In this paper we study a forest-valued Markov process which…
We investigate the genealogical structure of general critical or subcritical continuous-state branching processes. Analogously to the coding of a discrete tree by its contour function, this genealogical structure is coded by a real-valued…
Empirical likelihood is a powerful semi-parametric method increasingly investigated in the literature. However, most authors essentially focus on an i.i.d. setting. In the case of dependent data, the classical empirical likelihood method…