Transactions of the American Mathematical Society · 1988 · 283 citations · 22 references
EngineeringMathematicsDiscrete MathematicsProbability TheoryStochastic ProcessesDiscrete-time Stochastic ProcessesJump ProcessesMarkov ChainsMarkov ProcessesProbability InequalitiesReversible ProcessesContinuous-time Markov ChainsDiscrete-time Markov ChainsDiscrete-time Markov ProcessesMarkov Jump ProcessesMarkov Spectrum
We prove a general version of Cheeger’s inequality for discrete-time Markov chains and continuous-time Markovian jump processes, both reversible and nonreversible, with general state space. We also prove a version of Cheeger’s inequality for Markov chains and processes with killing. As an application, we prove <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper L squared"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mi>L</mml:mi> <mml:mn>2</mml:mn> </mml:msup> </mml:mrow> <mml:annotation encoding="application/x-tex">{L^2}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> exponential convergence to equilibrium for random walk with inward drift on a class of countable rooted graphs.
22
Algebraic connectivity of graphs
Miroslav Fiedler · Czechoslovak Mathematical Journal · 1973 · 4K citations · Full text
COMBINATORICA · 1986 · 1.2K citations
International Series of Numerical Mathematics
Eric G. Wagner · Mathematics of Computation · 1963 · 888 citations