Cheeger bound explained

In mathematics, the Cheeger bound is a bound of the second largest eigenvalue of the transition matrix of a finite-state, discrete-time, reversible stationary Markov chain. It can be seen as a special case of Cheeger inequalities in expander graphs.

Let

X

be a finite set and let

K(x,y)

be the transition probability for a reversible Markov chain on

X

. Assume this chain has stationary distribution

\pi

.

Define

Q(x,y)=\pi(x)K(x,y)

and for

A,B\subsetX

define

Q(A x B)=\sumxQ(x,y).

Define the constant

\Phi

as

\Phi=

min
S\subsetX,\pi(S)\leq
1
2
Q(S x Sc)
\pi(S)

.

The operator

K,

acting on the space of functions from

|X|

to

R

, defined by

(K\phi)(x)=\sumyK(x,y)\phi(y)

has eigenvalues

λ1\geqλ2\geq\geqλn

. It is known that

λ1=1

. The Cheeger bound is a bound on the second largest eigenvalue

λ2

.

Theorem (Cheeger bound):

1-2\Phi\leqλ2\leq1-

\Phi2
2

.

See also

References