Abstract
The mixing properties of several Markov chains to sample from configurations of a hard-core model have been examined. The model is familiar in the statistical physics of the liquid state and consists of a set of n nonoverlapping particle balls of radius r * in a d-dimensional hypercube. Starting from an initial configuration, standard Markov chain monte carlo methods may be employed to generate a configuration according to a probability distribution of interest by choosing a trial state and accepting or rejecting the trial state as the next configuration of the Markov chain according to the Metropolis filter. Procedures to generate a trial state include moving a single particle globally within the hypercube, moving a single particle locally, and moving multiple particles at once. We prove that (i) in a d-dimensional system a single-particle global-move Markov chain is rapidly mixing as long as the density is sufficiently low, (ii) in a one-dimensional system a single-particle local-move Markov chain is rapidly mixing for arbitrary density as long as the local moves are in a sufficiently small neighborhood of the original particle, and (iii) the one-dimensional system can be related to a convex body, thus establishing that certain multiple-particle local-move Markov chains mix rapidly. Difficulties extending this work are also discussed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allen, M.P., Tildesly, D.J.: Computer Simulation of Liquids. Oxford University Press, Oxford (1987)
Alder, B.J., Wainwright, T.E.: Phase Transition in Elastic Disks. Physical Review 127, 359–361 (1962)
Bubley, R., Dyer, M.: Path coupling: A technique for proving rapid mixing in Markov chains. In: 38th Annual Symposium on Foundations of Computer Science, pp. 223–231 (1997)
Conway, J.H., Sloane, N.J.A.: Sphere Packings, Lattices and Groups. Springer, New York (1988)
Diaconis, P., Saloff-Coste, L.: Logarithmic Sobolev inequalities for finite Markov chains. Annals of Applied Probability 6, 695–750 (1996)
Dyer, M., Frieze, A., Kannan, R.: A random polynomial time algorithm for approximating the volume of convex bodies. Journal of the ACM 38, 1–17 (1991)
Fishman, G.S.: Monte Carlo: Concepts, Algorithms, and Applications. Springer, New York (1996)
Gardner, M.: Martin Gardner’s New Mathematical Diversions from Scientific American, Simon and Shuster, CITY (1966)
Häggström, O.: Finite Markov Chains and Algorithmic Applications. Cambridge University Press, Cambridge (2002)
Jerrum, M.: Counting, sampling and integrating: algorithms and complexity. Lectures in Mathematics, ETH Zürich. Birkhäuser, Basel (2003)
Jerrum, M., Sinclair, A.: Polynomial-time approximation algorithms for the Ising model. SIAM Journal on Computing 22, 1087–1116 (1993)
Lovász, L., Kannan, R.: Faster mixing via average conductance. In: 31st Annual ACM Symposium on Theory of Computing, pp. 282–287 (1999)
Madras, N., Randall, D.: Markov chain decomposition for convergence rate analysis. Annals of Applied Probability 12, 581–606 (2002)
Mahoney, M.W., Jorgensen, W.L.: A five-site model for liquid water and the reproduction of the density anomaly by rigid, nonpolarizable potential functions. Journal of Chemical Physics 112, 8910–8922 (2000)
Mase, S., Møller, J., Stoyan, D., Waagepetersen, R.P., Döge, G.: Packing Densities and Simulated Tempering for Hard Core Gibbs Point Processes. Annals of the Institute of Statistical Mathematics 53, 661–680 (2001)
Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculation by fast computing machines. Journal of Chemical Physics 21, 1087–1092 (1953)
Newman, M.E.J., Barkema, G.T.: Monte Carlo Methods in Statistical Physics. Oxford University Press, Oxford (1999)
Stoyan, D., Kendall, W.S., Mecke, J.: Stochastic Geometry and Its Applications, 2nd edn. Wiley, New York (1995)
Tonks, L.: The Complete Equation of State of One, Two and Three-Dimensional Gases of Hard Elastic Sphere. Physical Review 50, 955–963 (1936)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kannan, R., Mahoney, M.W., Montenegro, R. (2003). Rapid Mixing of Several Markov Chains for a Hard-Core Model. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_68
Download citation
DOI: https://doi.org/10.1007/978-3-540-24587-2_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20695-8
Online ISBN: 978-3-540-24587-2
eBook Packages: Springer Book Archive