SearcharxivSearch

arXiv · 1902.01441

Exponential quasi-ergodicity for processes with discontinuous trajectories

Abstract

This paper tackles the issue of establishing a lower-bound on the asymptotic ratio of survival probabilities between two different initial conditions, asymptotically in time for a given Markov process with extinction. Such a comparison is a crucial step in recent techniques for proving exponential convergence to a quasi-stationary distribution. We introduce a weak form of the Harnack inequality as the essential ingredient for such a comparison. This property is actually a consequence of the convergence property we intend to prove. Its complexity appears as the price to pay for the level of flexibility required by our applications. We show in our illustrations how simply and efficiently it can be used nonetheless. As illustrations, we consider two continuous-time processes on R^d that do not satisfy the classical Harnack inequalities, even in a local version. The first one is a piecewise deterministic process while the second is a pure jump process with restrictions on the directions of its jumps.

Explore related subjects

Keep this discovery

BibTeXRIS

Aurélien Velleret. 2019-02-04. Exponential quasi-ergodicity for processes with discontinuous trajectories. https://arxiv.org/abs/1902.01441

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