SearcharxivSearch

arXiv · 1712.02762

Constant curvature metrics for Markov chains

Abstract

We consider metrics which are preserved under a $p$-Wasserstein transport map, up to a possible contraction. In the case $p=1$ this corresponds to a metric which is uniformly curved in the sense of coarse Ricci curvature. We investigate the existence of such metrics in the more general sense of pseudo-metrics, where the distance between distinct points is allowed to be 0, and show the existence for general Markov chains on compact Polish spaces. Further we discuss a notion of algebraic reducibility and its relation to the existence of multiple true pseudo-metrics with constant curvature. Conversely, when the Markov chain is irreducible and the state space finite we obtain effective uniqueness of a metric with uniform curvature up to scalar multiplication and taking the $p$th root, making this a natural intrinsic distance of the Markov chain. An application is given in the form of concentration inequalities for the Markov chain.

Explore related subjects

Keep this discovery

BibTeXRIS

Florian Völlering. 2017-12-07. Constant curvature metrics for Markov chains. https://arxiv.org/abs/1712.02762

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