English
Related papers

Related papers: A representation for exchangeable coalescent trees…

200 papers

The multi-species coalescent provides an elegant theoretical framework for estimating species trees and species demographics from genetic markers. Practical applications of the multi-species coalescent model are, however, limited by the…

Populations and Evolution · Quantitative Biology 2011-11-09 David Bryant , Remco Bouckaert , Joseph Felsenstein , Noah Rosenberg , Arindam RoyChoudhury

We consider the evolution of the genealogy of the population currently alive in a Feller branching diffusion model. In contrast to the approach via labeled trees in the continuum random tree world, the genealogies are modeled as equivalence…

Probability · Mathematics 2023-12-12 Andrej Depperschmidt , Andreas Greven

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…

Combinatorics · Mathematics 2019-03-06 Ben Hollering , Seth Sullivant

We study the conditions under which the isometry of spaces with metrics generated by weights given on the edges of finite trees is equivalent to the isomorphism of these trees. Similar questions are studied for ultrametric spaces generated…

Metric Geometry · Mathematics 2020-02-18 Oleksiy Dovgoshey

A partial order on the set of metric measure spaces is defined; it generalizes the Lipschitz order of Gromov. We show that our partial order is closed when metric measure spaces are equipped with the Gromov-weak topology and give a new…

Probability · Mathematics 2016-05-31 Max Grieshammer , Thomas Rippl

Process models are, like event data, first-class citizens in most process mining approaches. Several process modeling formalisms have been proposed and used, e.g., Petri nets, BPMN, and process trees. Despite their frequent use, little…

Data Structures and Algorithms · Computer Science 2024-08-01 Gero Kolhof , Sebastiaan J. van Zelst

In this paper we consider inhomogeneous Galton-Watson trees, and derive various moments for such processes: the number of vertices, the number of leaves, and the height of the tree. Also we make a simple condition of finiteness. We use…

Applications · Statistics 2025-05-09 Jakob G. Rasmussen , Troels Pedersen , Rasmus L. Olsen

The genealogy at a single locus of a constant size $N$ population in equilibrium is given by the well-known Kingman's coalescent. When considering multiple loci under recombination, the ancestral recombination graph encodes the genealogies…

Probability · Mathematics 2015-11-10 Andrej Depperschmidt , Etienne Pardoux , Peter Pfaffelhuber

Reversible measures of the Fleming-Viot process are shown to be characterized as quasi-invariant measures with a cocycle given in terms of the mutation operator. As applications, we give certain integral characterization of…

Probability · Mathematics 2016-09-07 Kenji Handa

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.…

Probability · Mathematics 2015-01-08 Erich Baur , Jean Bertoin

Tree structured graphical models are powerful at expressing long range or hierarchical dependency among many variables, and have been widely applied in different areas of computer science and statistics. However, existing methods for…

Machine Learning · Statistics 2014-01-17 Le Song , Han Liu , Ankur Parikh , Eric Xing

We consider a particular example of interplay between statistical models related to CFT on one hand, and to the spectral properties of ODE, known as ODE/IS correspondence, on the other hand. We focus at the representation of wave functions…

Mathematical Physics · Physics 2018-09-26 A. S. Gorsky , S. K. Nechaev , A. F. Valov

Ultametrics are an important class of distances used in applications such as phylogenetics, clustering and classification theory. Ultrametrics are essentially distances that can be represented by an edge-weighted rooted tree so that all of…

Combinatorics · Mathematics 2026-02-13 Katharina T. Huber , Vincent Moulton , Guillaume E. Scholz

The purpose of this paper is to extend the investigation of the Fleming-Viot process in discrete space started in a previous work to two specific examples. The first one corresponds to a random walk on the complete graph. Due to its…

Probability · Mathematics 2016-03-16 Bertrand Cloez , Marie-Noémie Thai

Let A be a standard Borel space, and consider the space A^{\bbN^{(k)}} of A-valued arrays indexed by all size-k subsets of \bbN. This paper concerns random measures on such a space whose laws are invariant under the natural action of…

Probability · Mathematics 2015-07-09 Tim Austin

We discuss the enumeration of Feynman diagrams at tree order for processes with external lines of different types. We show how this can be done by iterating algebraic Schwinger-Dyson equations. Asymptotic estimates for very many external…

High Energy Physics - Phenomenology · Physics 2011-09-13 P. D. Draggiotis , R. Kleiss

We introduce a general framework for de Finetti reduction results, applicable to various notions of partially exchangeable probability distributions. Explicit statements are derived for the cases of exchangeability, Markov exchangeability,…

Probability · Mathematics 2018-01-17 Ivan Bardet , Cécilia Lancien , Ion Nechita

The generalized Fleming-Viot processes were defined in 1999 by Donnelly and Kurtz using a particle model and by Bertoin and Le Gall in 2003 using stochastic flows of bridges. In both methods, the key argument used to characterize these…

Probability · Mathematics 2012-06-06 Clément Foucart

We establish a one-to-one correspondence between (i) exchangeable sequences of random variables whose finite-dimensional distributions are minimum (or maximum) infinitely divisible and (ii) non-negative, non-decreasing, infinitely divisible…

Probability · Mathematics 2022-09-21 Florian Brück , Jan-Frederik Mai , Matthias Scherer

Tree-shaped graphical models are widely used for their tractability. However, they unfortunately lack expressive power as they require committing to a particular sparse dependency structure. We propose a novel class of generative models…

Machine Learning · Computer Science 2023-03-30 Nikil Roashan Selvam , Honghua Zhang , Guy Van den Broeck