SearcharxivSearch

arXiv · 2105.09677

On rate of convergence estimates for homogeneous discrete-time nonlinear Markov chains

Abstract

The paper studies an improved estimate for the rate of convergence for nonlinear homogeneous discrete-time Markov chains. These processes are nonlinear in terms of the distribution law. Hence, the transition kernels are dependent on the current probability distributions of the process apart from being dependent on the current state. Such processes often act as limits for large-scale systems of dependent Markov chains with interaction. The paper generalizes the convergence results by taking the estimate over two steps. Such an approach keeps the existence and uniqueness results under assumptions that are analogical to the one-step result. It is shown that such an approach may lead to a better rate of convergence. Several examples provided illustrating the fact that the suggested estimate may have a better rate of convergence than the original one. Also, it is shown that the new estimate may even be applicable in some cases when the conditions of the result on one step cannot guarantee any convergence. Finally, these examples depict that the original conditions may not be an obstacle for the convergence of nonlinear Markov chains.

Explore related subjects

Keep this discovery

BibTeXRIS

Aleksandr Shchegolev. 2021-05-20. On rate of convergence estimates for homogeneous discrete-time nonlinear Markov chains. https://arxiv.org/abs/2105.09677

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