SearcharxivSearch

arXiv · math/0605665

Quasi stationary distributions and Fleming-Viot processes in countable spaces

Abstract

We consider an irreducible pure jump Markov process with rates Q=(q(x,y)) on Λ\cup\{0\} with Λcountable and 0 an absorbing state. A quasi-stationary distribution (qsd) is a probability measure νon Λthat satisfies: starting with ν, the conditional distribution at time t, given that at time t the process has not been absorbed, is still ν. That is, ν(x) = νP_t(x)/(\sum_{y\inΛ}νP_t(y)), with P_t the transition probabilities for the process with rates Q. A Fleming-Viot (fv) process is a system of N particles moving in Λ. Each particle moves independently with rates Q until it hits the absorbing state 0; but then instantaneously chooses one of the N-1 particles remaining in Λand jumps to its position. Between absorptions each particle moves with rates Q independently. Under the condition α:=\sum_x\inf Q(\cdot,x) > \sup Q(\cdot,0):=C we prove existence of qsd for Q; uniqueness has been proven by Jacka and Roberts. When α>0 the {\fv} process is ergodic for each N. Under α>C the mean normalized densities of the fv unique stationary measure converge to the qsd of Q, as N \to \infty; in this limit the variances vanish.

Explore related subjects

Keep this discovery

BibTeXRIS

Pablo A. Ferrari, Nevena Maric. 2006-05-25. Quasi stationary distributions and Fleming-Viot processes in countable spaces. https://arxiv.org/abs/math/0605665

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