Abstract
We relate the mixing time of Markov chains on a partial order with unique minimal and maximal elements to the solution of associated linear programs. The linear minimization program we construct has one variable per state and (the square of) its solution is an upper bound on the mixing time. The proof of this theorem uses the coupling technique and a generalization of the distance function commonly used in this context. Explicit solutions are obtained for the simple Markov chains on the hypercube and on the independent sets of a complete bipartite graph.
As an application we define new a Markov chain on the down-sets (ideals) of a partial order for which our technique yields a simple proof of rapid mixing, provided that in the Hasse-graph of the partial order the number of elements at distance at most 2 from any given element is bounded by 4. This chain is a variation of the Luby-Vigoda chain on independent sets, which can also be used directly to sample down-sets, but our result applies to a larger class of partial orders.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Aldous. Random walks on finite groups and rapidly mixing Markov chains. In Seminaire de Probabilites XVII, volume 986 of Lecture Notes in Math., pages 243–297. Springer Verlag, 1983.
L. Babai. Local expansion of symmetrical graphs. Combinatorics, Probability and Computing, 1:1–11, 1992.
Richard Durett. Probability: Theory and Examples. Duxbury Press, Belmont, CA, 1991.
M. Dyer and C. Greenhill. On Markov chains for independent sets. Preprint available at http://www.scs.leeds.ac.uk/rand/acg.html, 1997.
M. Jerrum, L. Valiant, and V. Vazirani. Random generation of combinatorial structures from a uniform generation. Theoretical Computer Science, 43:169–188, 1986.
N. Kahale. A semidefinite bound for mixing rates of Markov chains. Technical Report 95-41, DIMACS, 1995.
M. Luby, D. Randall, and A. Sinclair. Markov chain algorithms for planar lattice structures. In Proc. of the 36th Symposium on Foundations of Computer Science, pages 150–159. IEEE, 1995. Extended abstract.
M. Luby and E. Vigoda. Approximately counting up to four (extended abstract). In 29th STOC. ACM, feb 1997.
J.G. Propp and D.B. Wilson. Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures and Algorithms, 9(1 & 2), August/September 1996.
A. Sharell. Complexité Descriptive et l’Approximation des fonctions de dénombrement. PhD thesis, L.R.I., Université Paris Sud, February 1998. Available at http://www.lri.fr/~sharell.
A. Sinclair. Algorithms for Random Generation & Counting. Birkhäuser, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sharell, A. (1998). A Note on Bounding the Mixing Time by Linear Programming. In: Luby, M., Rolim, J.D.P., Serna, M. (eds) Randomization and Approximation Techniques in Computer Science. RANDOM 1998. Lecture Notes in Computer Science, vol 1518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49543-6_9
Download citation
DOI: https://doi.org/10.1007/3-540-49543-6_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65142-0
Online ISBN: 978-3-540-49543-7
eBook Packages: Springer Book Archive