SearcharxivSearch

arXiv · 1002.0159

Wright-Fisher diffusion with negative mutation rates

Abstract

We study a family of n-dimensional diffusions, taking values in the unit simplex of vectors with nonnegative coordinates that add up to one. These processes satisfy stochastic differential equations which are similar to the ones for the classical Wright-Fisher diffusions, except that the "mutation rates" are now nonpositive. This model, suggested by Aldous, appears in the study of a conjectured diffusion limit for a Markov chain on Cladograms. The striking feature of these models is that the boundary is not reflecting, and we kill the process once it hits the boundary. We derive the explicit exit distribution from the simplex and probabilistic bounds on the exit time. We also prove that these processes can be viewed as a "stochastic time-reversal" of a Wright-Fisher process of increasing dimensions and conditioned at a random time. A key idea in our proofs is a skew-product construction using certain one-dimensional diffusions called Bessel-square processes of negative dimensions, which have been recently introduced by Going-Jaeschke and Yor.

Explore related subjects

Keep this discovery

BibTeXRIS

Soumik Pal. 2010-01-31. Wright-Fisher diffusion with negative mutation rates. https://doi.org/10.1214/11-aop704

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