Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.