Search arXivSearch

arXiv · 2011.07671

Exponential ergodicity in the bounded-Lipschitz distance for a subclass of piecewise-deterministic Markov processes with random switching between flows

Abstract

In this paper, we study a subclass of piecewise-deterministic Markov processes with a Polish state space, involving deterministic motion punctuated by random jumps that occur at exponentially distributed time intervals. Over each of these intervals, the process follows a flow, selected randomly among a finite set of all possible ones. Our main goal is to provide a set of verifiable conditions guaranteeing the exponential ergodicity for such processes (in terms of the bounded Lipschitz distance), which would refer only to properties of the flows and the transition law of the Markov chain given by the post-jump locations. Moreover, we establish a simple criterion on the exponential ergodicity for a particular instance of these processes, applicable to certain biological models, where the jumps result from the action of an iterated function system with place-dependent probabilities.

Explore related subjects

Keep this discovery

BibTeXRIS

Dawid Czapla, Katarzyna Horbacz, Hanna Wojewódka-Ściążko. 2020-11-16. Exponential ergodicity in the bounded-Lipschitz distance for a subclass of piecewise-deterministic Markov processes with random switching between flows. https://doi.org/10.1016/j.na.2021.112678

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