Conductance and Eigenvalue

TL;DR

This paper proves a new inequality relating conductance and eigenvalues of finite-state ergodic reversible Markov chains, strengthening previous bounds and using a modified proof technique applicable to both Markov chains and regular graphs.

Contribution

It introduces a tighter inequality between conductance and eigenvalues, improving upon classical bounds for reversible Markov chains.

Findings

Established a new inequality: ^2 + \u03bb^2  1.

Extended proof techniques to Markov chains and regular graphs.

Strengthened understanding of spectral gap bounds.

Abstract

We show the following. \begin{theorem} Let $M$ be an finite-state ergodic time-reversible Markov chain with transition matrix $P$ and conductance $\phi$. Let $\lambda \in (0,1)$ be an eigenvalue of $P$. Then, $$\phi^2 + \lambda^2 \leq 1$$ \end{theorem} This strengthens the well-known~\cite{HLW,Dod84, AM85, Alo86, JS89} inequality $\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.