English

Conductance and Eigenvalue

Discrete Mathematics 2010-09-10 v1

Abstract

We show the following. \begin{theorem} Let MM be an finite-state ergodic time-reversible Markov chain with transition matrix PP and conductance ϕ\phi. Let λ(0,1)\lambda \in (0,1) be an eigenvalue of PP. Then, ϕ2+λ21\phi^2 + \lambda^2 \leq 1 \end{theorem} This strengthens the well-known~\cite{HLW,Dod84, AM85, Alo86, JS89} inequality λ1ϕ2/2\lambda \leq 1- \phi^2/2. 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}
}
R2 v1 2026-06-21T16:11:39.812Z