Nash inequalities for finite Markov chains
- Cite this article as:
- Diaconis, P. & Saloff-Coste, L. J Theor Probab (1996) 9: 459. doi:10.1007/BF02214660
- 145 Downloads
This paper develops bounds on the rate of decay of powers of Markov kernels on finite state spaces. These are combined with eigenvalue estimates to give good bounds on the rate of convergence to stationarity for finite Markov chains whose underlying graph has moderate volume growth. Roughly, for such chains, order (diameter) steps are necessary and suffice to reach stationarity. We consider local Poincaré inequalities and use them to prove Nash inequalities. These are bounds onl2-norms in terms of Dirichlet forms andl1-norms which yield decay rates for iterates of the kernel. This method is adapted from arguments developed by a number of authors in the context of partial differential equations and, later, in the study of random walks on infinite graphs. The main results do not require reversibility.