SearcharxivSearch

arXiv · 2407.02054

Condensation in Fleming--Viot particle systems with fast selection mechanism

Abstract

We study the Fleming--Viot particle system in a discrete state space, in the regime of a fast selection mechanism, namely with killing rates which grow to infinity. This asymptotics creates a time scale separation which results in the formation of a condensate of all particles, which then evolves according to a continuous-time Markov chain with jump rates depending in a nontrivial way on both the underlying mutation dynamics and the relative speed of growth to infinity of the killing rate between neighbouring sites. We prove the convergence of the particle system and completely describe the dynamics of the condensate in the case where the number of particles is kept fixed, and partially in the case when the number of particles goes to infinity together with (but slower than) the minimal killing rate.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lucas Journel, Tony Lelièvre, Julien Reygner. 2024-07-02. Condensation in Fleming--Viot particle systems with fast selection mechanism. https://arxiv.org/abs/2407.02054

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