Ergodic convergence rates of Markov processes--eigenvalues, inequalities and ergodic theory
Mu-Fa Chen
Abstract
This paper consists of four parts. In the first part, we explain what eigenvalues we are interested in and show the difficulties of the study on the first (non-trivial) eigenvalue through examples. In the second part, we present some (dual) variational formulas and explicit bounds for the first eigenvalue of Laplacian on Riemannian manifolds or Jacobi matrices (Markov chains). Here, a probabilistic approach--the coupling methods is adopted. In the third part, we introduce recent lower bounds of several basic inequalities; these are based on a generalization of Cheeger's approach which comes from Riemannian geometry. In the last part, a diagram of nine different types of ergodicity and a table of explicit criteria for them are presented. These criteria are motivated by the weighted Hardy inequality which comes from Harmonic analysis.
Create a lesson
Related papers
Boolean Small-Ball Inequalities for Discrepancy Theory
Emrullah Akbas, Suvrit Sra
Markovian renormalisation for percolation in high-dimension: Semi-decidability of mean field behavior
Arthur Blanc-Renaudie
Point process convergence of large inradii of Poisson-Laguerre tessellations
Matthias Schulte, Martina Švarc Petráková
Interpolation of Gaussian Free Fields via Random Matrices
Gabriel Raposo
Almost-Uniform Bayesian Convergence to the Truth Is Not Characterized by Countable Additivity on Conditional Hitting Times
M. Ali Khan, Arthur Paul Pedersen, Maxwell B. Stinchcombe
The skeleton-blocks decomposition of Bienaymé trees, and applications to their local convergence
Marc Bernard, Robin Stephenson