SearcharxivSearch

arXiv · 2306.03585

Selection principle for the Fleming-Viot process with drift $-1$

Abstract

We consider the Fleming-Viot particle system consisting of $N$ identical particles evolving in $\mathbb{R}_{>0}$ as Brownian motions with constant drift $-1$. Whenever a particle hits $0$, it jumps onto another particle in the interior. It is known that this particle system has a hydrodynamic limit as $N\rightarrow\infty$ given by Brownian motion with drift $-1$ conditioned not to hit $0$. This killed Brownian motion has an infinite family of quasi-stationary distributions (QSDs), with a Yaglom limit given by the unique QSD minimising the survival probability. On the other hand, for fixed $N<\infty$, this particle system converges to a unique stationary distribution as time $t\rightarrow\infty$. We prove the following selection principle: the empirical measure of the $N$-particle stationary distribution converges to the aforedescribed Yaglom limit as $N\rightarrow\infty$. The selection problem for this particular Fleming-Viot process is closely connected to the microscopic selection problem in front propagation, in particular for the $N$-branching Brownian motion. The proof requires neither fine estimates on the particle system nor the use of Lyapunov functions.

Explore related subjects

Keep this discovery

BibTeXRIS

Oliver Tough. 2023-06-06. Selection principle for the Fleming-Viot process with drift $-1$. https://arxiv.org/abs/2306.03585

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