SearcharxivSearch

arXiv · 2409.19246

Quasi-stationary distributions of non-absorbing Markov chains

Abstract

We consider reversible ergodic Markov chains with finite state space, and we introduce a new notion of quasi-stationary distribution that does not require the presence of any absorbing state. In our setting, the hitting time of the absorbing set is replaced by an optimal strong stationary time, representing the ``hitting time of the stationary distribution''. On the one hand, we show that our notion of quasi-stationary distribution corresponds to the natural generalization of the \emph{Yaglom limit}. On the other hand, similarly to the classical quasi-stationary distribution, we show that it can be written in terms of the eigenvectors of the underlying Markov kernel, and it is therefore amenable of a geometric interpretation. Moreover, we recover the usual exponential behavior that characterizes quasi-stationary distributions and metastable systems. We also provide some toy examples, which show that the phenomenology is richer compared to the absorbing case. Finally, we present some counterexamples, showing that the assumption on the reversibility cannot be weakened in general.

Explore related subjects

Keep this discovery

BibTeXRIS

Roberto Fernandez, Francesco Manzo, Matteo Quattropani, Elisabetta Scoppola. 2024-09-28. Quasi-stationary distributions of non-absorbing Markov chains. https://arxiv.org/abs/2409.19246

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