The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume

A. Sinclair and M. Jerrum (1988) derived a bound on the mixing rate of time-reversible Markov chains in terms of their conductance. The authors generalize this result by not assuming time reversibility and using a weaker notion of conductance. They prove an isoperimetric inequality for subsets of a...

Full description

Saved in:
Bibliographic Details
Published inFoundations of Computer Science, 31st Symposium pp. 346 - 354 vol. 1
Main Authors Lovasz, L., Simonovits, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1990
Subjects
Algorithm design and analysis
Lattices
Law
Legal factors
Polynomials
Testing
Online AccessGet full text
ISBN081862082X
9780818620829
DOI10.1109/FSCS.1990.89553

Cover

More Information
Summary:A. Sinclair and M. Jerrum (1988) derived a bound on the mixing rate of time-reversible Markov chains in terms of their conductance. The authors generalize this result by not assuming time reversibility and using a weaker notion of conductance. They prove an isoperimetric inequality for subsets of a convex body. These results are combined to simplify an algorithm of M. Dyer et al. (1989) for approximating the volume of a convex body and to improve running-time bounds.< >
ISBN:081862082X
9780818620829
DOI:10.1109/FSCS.1990.89553