# A representation for exchangeable coalescent trees and generalized tree-valued Fleming-Viot processes

@article{Gufler2016ARF,
title={A representation for exchangeable coalescent trees and generalized tree-valued Fleming-Viot processes},
author={Stephan Gufler},
journal={arXiv: Probability},
year={2016}
}
We give a de Finetti type representation for exchangeable random coalescent trees (formally described as semi-ultrametrics) in terms of sampling iid sequences from marked metric measure spaces. We apply this representation to define versions of tree-valued Fleming-Viot processes from a $\Xi$-lookdown model. As state spaces for these processes, we use, besides the space of isomorphy classes of metric measure spaces, also the space of isomorphy classes of marked metric measure spaces and a space…
Convergence of tree-valued Cannings chains
We consider sequences of tree-valued Markov chains that describe evolving genealogies in Cannings models, and we show their convergence in distribution to tree-valued Fleming-Viot processes. Under
Invariance principles for tree-valued Cannings chains
We consider sequences of tree-valued Markov chains that describe evolving genealogies in Cannings models, and we show their convergence in distribution to tree-valued Fleming-Viot processes. Under
Exchangeable coalescents, ultrametric spaces, nested interval-partitions: A unifying approach
• Mathematics
The Annals of Applied Probability
• 2021
Kingman (1978)'s representation theorem states that any exchangeable partition of N can be represented as a paintbox based on a random mass-partition. Similarly, any exchangeable composition (i.e.
Convergence of genealogies through spinal decomposition with an application to population genetics
• Mathematics
• 2022
Consider a branching Markov process with values in some general type space. Conditional on survival up to generation N , the genealogy of the extant population defines a random marked metric measure
Evolving genealogies for branching populations under selection and competition
• Mathematics
• 2021
For a continuous state branching process with two types of individuals which are subject to selection and density dependent competition, we characterize the joint evolution of population size, type
Genealogies and inference for populations with highly skewed offspring distributions
• Biology
• 2019
Inference methods under the infinitely-many sites model which allow both model selection and estimation of model parameters under these coalescents are discussed.
A representation of exchangeable hierarchies by sampling from random real trees
• Mathematics
• 2018
A hierarchy on a set S, also called a total partition of S, is a collection $$\mathcal {H}$$H of subsets of S such that $$S \in \mathcal {H}$$S∈H, each singleton subset of S belongs to \mathcal

## References

SHOWING 1-10 OF 59 REFERENCES
Pathwise construction of tree-valued Fleming-Viot processes
In a random complete and separable metric space that we call the lookdown space, we encode the genealogical distances between all individuals ever alive in a lookdown model with simultaneous multiple
Convergence of tree-valued Cannings chains
We consider sequences of tree-valued Markov chains that describe evolving genealogies in Cannings models, and we show their convergence in distribution to tree-valued Fleming-Viot processes. Under
Invariance principles for tree-valued Cannings chains
We consider sequences of tree-valued Markov chains that describe evolving genealogies in Cannings models, and we show their convergence in distribution to tree-valued Fleming-Viot processes. Under
A modified lookdown construction for the Xi-Fleming-Viot process with mutation and populations with recurrent bottlenecks
• Mathematics
• 2008
Letbe a finite measure on the unit interval. A �-Fleming-Viot process is a probability measure valued Markov process which is dual to a coalescent with multiple collisions (�-coalescent) in analogy
Generalized Fleming-Viot processes with immigration via stochastic flows of partitions
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
Convergence in distribution of random metric measure spaces (Λ-coalescent measure trees)
• Mathematics
• 2009
We consider the space of complete and separable metric spaces which are equipped with a probability measure. A notion of convergence is given based on the philosophy that a sequence of metric measure
The spatial Lambda-Fleming-Viot process: an event-based construction and a lookdown representation
• Mathematics
• 2012
We construct a measure-valued equivalent to the spatial Lambda-Fleming-Viot process (SLFV) introduced in [Eth08]. In contrast with the construction carried out in [Eth08], we fix the realization of
Small-time behavior of beta coalescents
• Mathematics
• 2008
For a finite measureon (0,1), the �-coalescent is a coalescent process such that, whenever there are b clusters, each k-tuple of clusters merges into one at rate R 1 0 x k 2 (1 x) b k �(dx). It has
Coalescents with multiple collisions
k−2 � 1 − xb−k � � dx� . Call this process a � -coalescent. Discrete measure-valued processes derived from the � -coalescent model a system of masses undergoing coalescent collisions. Kingman's
Marked metric measure spaces
• Mathematics
• 2011
A marked metric measure space (mmm-space) is a triple $(X,r,μ)$, where $(X,r)$ is a complete and separable metric space and $μ$ is a probability measure on $X \times I$ for some Polish space $I$ of