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

### 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

### 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

### Doob--Martin boundary of R\'emy's tree growth chain

• Mathematics
• 2014
R\'emy's algorithm is a Markov chain that iteratively generates a sequence of random trees in such a way that the $n^{\mathrm{th}}$ tree is uniformly distributed over the set of rooted, planar,

### 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 65 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

### Path-properties of the tree-valued Fleming-Viot process

• Mathematics
• 2012
We consider the tree-valued Fleming–Viot process, (Xt )t≥0 , with mutation and selection. This process models the stochastic evolution of the genealogies and (allelic) types under resampling,

### Stochastic flows associated to coalescent processes

• Mathematics
• 2003
Abstract. We study a class of stochastic flows connected to the coalescent processes that have been studied recently by Möhle, Pitman, Sagitov and Schweinsberg in connection with asymptotic models

### Tree-valued Fleming–Viot dynamics with mutation and selection

• Mathematics
• 2012
The Fleming-Viot measure-valued diffusion is a Markov process describing the evolution of (allelic) types under mutation, selection and random reproduction. We enrich this process by genealogical

### 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

### A countable representation of the Fleming-Viot measure-valued diffusion

• Mathematics
• 1996
The Fleming-Viot measure-valued diffusion arises as the infinite population limit of various discrete genetic models with general type space. The paper gives a countable construction of the process

### Tree-valued resampling dynamics Martingale problems and applications

• Mathematics
• 2008
The measure-valued Fleming–Viot process is a diffusion which models the evolution of allele frequencies in a multi-type population. In the neutral setting the Kingman coalescent is known to generate

### 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