SearcharxivSearch

arXiv · 1907.11036

Ricci curvature and $W_1$-exponential convergence of Markov processes on graphs

Abstract

In this paper, we show that the Ricci curvature lower bound in Ollivier's Wasserstein metric sense of a continuous time jumping Markov process on a graph can be characterized by some optimal coupling generator and provide the construction of this latter. Some previous results of Ollivier for discrete time Markov chains are generalized to the actual continuous time case. We propose a comparison technique with some death-birth process on $\mathbb N$ to obtain some explicit exponential convergence rate, by modifying the metric. A counterpart of Zhong-Yang's estimate is established in the case where the Ricci curvature with repsect to the graph metric is nonnegative. Moreover we show that the Lyapunov function method for the exponential convergence works with some explicit quantitative estimates, once if the Ricci curvature is bounded from below by a negative constant. Finally we present applications to Glauder dynamics under some dynamical versions of the Dobrushin uniqueness condition or of the Dobrushin-Shlosman analyticity condition.

Explore related subjects

Keep this discovery

BibTeXRIS

Lingyan Cheng, Ruinan Li, Liming Wu. 2019-07-25. Ricci curvature and $W_1$-exponential convergence of Markov processes on graphs. https://arxiv.org/abs/1907.11036

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