Search arXivSearch

arXiv · math/0703875

Coalescent processes arising in a study of diffusive clustering

Abstract

This paper studies the spatial coalescent on $\Z^2$. In our setting, the partition elements are located at the sites of $\Z^2$ and undergo local delayed coalescence and migration. That is, pairs of partition elements located at the same site coalesce into one partition element after exponential waiting times. In addition, the partition elements perform independent random walks. The system starts in either locally finite configurations or in configurations containing countably many partition elements per site. These two situations are relevant if the coalescent is used to study the scaling limits for genealogies in Moran models respectively interacting Fisher-Wright diffusions (or Fleming-Viot processes), which is the key application of the present work. Our goal is to determine the longtime behavior with an initial population of countably many individuals per site restricted to a box $[-t^{α/2}, t^{α/2}]^2 \cap \Z^2$ and observed at time $t^β$ with $1 \geq β\geq α\ge 0$. We study both asymptotics, as $t\to\infty$, for a fixed value of $α$ as the parameter $β\in[α,1]$ varies, and for a fixed $β$, as the parameter $α\in [0,β]$ varies. This exhibits the genealogical structure of the mono-type clusters arising in 2-dimensional Moran and Fisher-Wright systems. (... for more see the actual preprint)

Explore related subjects

Keep this discovery

BibTeXRIS

Andreas Greven, Vlada Limic, Anita Winter. 2009-10-07. Coalescent processes arising in a study of diffusive clustering. https://arxiv.org/abs/math/0703875

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