SearcharxivSearch

arXiv · 0806.2224

Tree-valued resampling dynamics: Martingale Problems and applications

Abstract

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 the genealogies of the "individuals" in the population at a fixed time. The goal of the present paper is to replace this static point of view on the genealogies by an analysis of the evolution of genealogies. We encode the genealogy of the population as an (isometry class of an) ultra-metric space which is equipped with a probability measure. The space of ultra-metric measure spaces together with the Gromov-weak topology serves as state space for tree-valued processes. We use well-posed martingale problems to construct the tree-valued resampling dynamics of the evolving genealogies for both the finite population Moran model and the infinite population Fleming-Viot diffusion. We show that sufficient information about any ultra-metric measure space is contained in the distribution of the vector of subtree lengths obtained by sequentially sampled "individuals". We give explicit formulas for the evolution of the Laplace transform of the distribution of finite subtrees under the tree-valued Fleming-Viot dynamics.

Explore related subjects

Keep this discovery

BibTeXRIS

Andreas Greven, Peter Pfaffelhuber, Anita Winter. 2011-06-23. Tree-valued resampling dynamics: Martingale Problems and applications. https://arxiv.org/abs/0806.2224

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR