Conductance and Eigenvalue
Discrete Mathematics
2010-09-10 v1
Abstract
We show the following. \begin{theorem} Let be an finite-state ergodic time-reversible Markov chain with transition matrix and conductance . Let be an eigenvalue of . Then, \end{theorem} This strengthens the well-known~\cite{HLW,Dod84, AM85, Alo86, JS89} inequality . We obtain our result by a slight variation in the proof method in \cite{JS89, HLW}; the same method was used earlier in \cite{RS06} to obtain the same inequality for random walks on regular undirected graphs.
Keywords
Cite
@article{arxiv.1009.1756,
title = {Conductance and Eigenvalue},
author = {Girish Varma},
journal= {arXiv preprint arXiv:1009.1756},
year = {2010}
}