SearcharxivSearch

arXiv · 1604.02294

Ergodicity and uniform in time truncation bounds for inhomogeneous birth and death processes with additional transitions from and to origin

Abstract

In this paper one presents the extension of the transient analysis of the class of continuous-time birth and death processes defined on non-negative integers with special transitions from and to the origin. From the origin transitions can occur to any state. But being in any other state, besides ordinary transitions to neighbouring states, a transition to the origin can occur. All possible transition intensities are assumed to be non-random functions of time and may depend on the state of the process. We improve previously known ergodicity and truncation bounds for this class of processes which were known only for the case when transitions from the origin decay exponentially (other intensities must have unique uniform upper bound). We show how the bounds can be obtained the decay rate is slower than exponential. Numerical results are also provided.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander Zeifman, Anna Korotysheva, Yacov Satin, Rostislav Razumchik, Victor Korolev, Sergey Shorgin. 2016-04-08. Ergodicity and uniform in time truncation bounds for inhomogeneous birth and death processes with additional transitions from and to origin. https://arxiv.org/abs/1604.02294

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