SearcharxivSearch

arXiv · 2007.01264

The entropy method under curvature-dimension conditions in the spirit of Bakry-\'Emery in the discrete setting of Markov chains

Abstract

We consider continuous-time (not necessarily finite) Markov chains on discrete spaces and identify a curvature-dimension inequality, the condition $CD_\Upsilon(\kappa,\infty)$, which serves as a natural analogue of the classical Bakry-\'Emery condition $CD(\kappa,\infty)$ in several respects. In particular, it is tailor-made to the classical approach of proofing the modified logarithmic Sobolev inequality via computing and estimating the second time derivative of the entropy along the heat flow generated by the generator of the Markov chain. We prove that curvature bounds in the sense of $CD_\Upsilon$ are preserved under tensorization, discuss links to other notions of discrete curvature and consider a variety of examples including complete graphs, the hypercube and birth-death processes. We further consider power type entropies and determine, in the same spirit, a natural CD condition which leads to Beckner inequalities. The $CD_\Upsilon$ condition is also shown to be compatible with the diffusive setting, in the sense that corresponding hybrid processes enjoy a tensorization property.

Explore related subjects

Keep this discovery

BibTeXRIS

Frederic Weber, Rico Zacher. 2020-07-02. The entropy method under curvature-dimension conditions in the spirit of Bakry-\'Emery in the discrete setting of Markov chains. https://arxiv.org/abs/2007.01264

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