Related papers: A representation for exchangeable coalescent trees…
We analyze the interplay between labeled trees and the ultrametric spaces they present. We provide characterizations of labeled trees that generate separable ultrametric spaces and those that generate locally finite ultrametric spaces. In…
We investigate the interrelations between the metric properties, order properties and combinatorial properties of the set of balls in totally bounded ultrametric space. In particular, the Gurvich-Vyalyi representation of finite, ultrametric…
Consider a random real tree whose leaf set, or boundary, is endowed with a finite mass measure. Each element of the tree is further given a type, or allele, inherited from the most recent atom of a random point measure…
We introduce new estimation methods for a sub-class of the Gaussian scale mixture models for wavelet trees by Wainwright, Simoncelli & Willsky that rely on modern results for composite likelihoods and approximate Bayesian inference. Our…
We consider species tree estimation under a standard stochastic model of gene tree evolution that incorporates incomplete lineage sorting (as modeled by a coalescent process) and gene duplication and loss (as modeled by a branching…
Phylogenetic trees are the fundamental mathematical representation of evolutionary processes in biology. They are also objects of interest in pure mathematics, such as algebraic geometry and combinatorics, due to their discrete geometry.…
The (\Xi, A)-Fleming-Viot process with mutation is a probability-measure-valued process whose moment dual is similar to that of the classical Fleming-Viot process except that the Kingman's coalescent is replaced by the \Xi-coalescent, the…
This work addresses an enumeration problem on weighted bi-colored plane trees with prescribed vertex data, with all vertices labeled distinctly. We give a bijection proof of the enumeration formula originally due to Kochetkov, hence…
Phylogenetic trees are a central tool in understanding evolution. They are typically inferred from sequence data, and capture evolutionary relationships through time. It is essential to be able to compare trees from different data sources…
Species sampling processes have long served as the fundamental framework for modeling random discrete distributions and exchangeable sequences. However, data arising from distinct but related sources require a broader notion of…
The recursive and hierarchical structure of full rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. In most of these cases, the full rooted tree is…
We consider ferromagnetic Ising models on graphs that converge locally to trees. Examples include random regular graphs with bounded degree and uniformly random graphs with bounded average degree. We prove that the "cavity" prediction for…
We investigate the statistics of trees grown from some initial tree by attaching links to preexisting vertices, with attachment probabilities depending only on the valence of these vertices. We consider the asymptotic mass distribution that…
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…
We propose isomorphism type identities for nonlinear functionals of general infinitely divisible processes. Such identities can be viewed as an analogy of the Cameron-Martin formula for Poissonian infinitely divisible processes but with…
A mixed Gaussian fractional process $\{Y(t)\}_{t \in {\Bbb R}} = \{PX(t)\}_{t \in {\Bbb R}}$ is a multivariate stochastic process obtained by pre-multiplying a vector of independent, Gaussian fractional process entries $X$ by a nonsingular…
Consider a system $X = ((x_\xi(t)), \xi \in \Omega_N)_{t \geq 0}$ of interacting Fleming-Viot diffusions with mutation and selection which is a strong Markov process with continuous paths and state space $(\CP(\I))^{\Omega_N}$, where $\I$…
Can we do arithmetic in a completely different way, with a radically different data structure? Could this approach provide practical benefits, like operations on giant numbers while having an average performance similar to traditional…
We define and study a family of Markov processes with state space the compact set of all partitions of N that we call exchangeable fragmentation-coalescence processes. They can be viewed as a combination of exchangeable fragmentation as…
This paper demonstrates that every ultrametric space is homeomorphic to a clade space of a pruned tree, i.e., a subspace of a tree's canopy. Furthermore, it characterizes several topological properties of ultrametrizable spaces through the…