Rapid mixing of several Markov chains for a hard-core model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2906, Issue , 2003, Pages 663-675

  Kannan, Ravi ^a   Mahoney, Michael W ^b   Montenegro, Ravi ^c  

^a Yale University   (United States)

^b YALE UNIVERSITY   (United States)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHAINS; MIXING; MONTE CARLO METHODS; PROBABILITY DISTRIBUTIONS;

DIMENSIONAL SYSTEMS; INITIAL CONFIGURATION; MARKOV CHAIN MONTE CARLO METHOD; MIXING PROPERTY; MULTIPLE PARTICLES; ONE-DIMENSIONAL SYSTEMS; SINGLE PARTICLE; STATISTICAL PHYSICS;

MARKOV PROCESSES;

EID: 35248894368     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_68     Document Type: Article

References (20)

1. M.P. ALLEN AND D.J. TILDESLY, Computer Simulation of Liquids. (Oxford University Press, Oxford, 1987).
2. B.J. ALDER AND T.E. WAINWRIGHT, Phase Transition in Elastic Disks. Physical Review, 127:359-361, 1962.
3. R. BUBLEY AND M. DYER, Path coupling: A technique for proving rapid mixing in Markov chains. 38th Annual Symposium on Foundations of Computer Science, pp. 223-231, 1997.
4. J.H. CONWAY AND N.J.A. SLOANE, Sphere Packings, Lattices and Groups. (Springer-Verlag, New York, 1988).
5. P. DIACONIS AND L. SALOFF-COSTE, Logarithmic Sobolev inequalities for finite Markov chains. Annals of Applied Probability, 6:695-750, 1996.
6. M. DYER, A. FRIEZE AND R. KANNAN, A random polynomial time algorithm for approximating the volume of convex bodies. Journal of the ACM, 38:1-17, 1991.
7. G.S. FISHMAN, Monte Carlo: Concepts, Algorithms, and Applications. (Springer-Verlag, New York, 1996).
8. M. GARDNER, Martin Gardner's New Mathematical Diversions from Scientific American. (Simon and Shuster, CITY, 1966).
9. O. HÄGGSTRÖM, Finite Markov Chains and Algorithmic Applications. (Cambridge University Press, Cambridge, 2002).
10. M. JERRUM, Counting, sampling and integrating: algorithms and complexity. Lectures in Mathematics, ETH Zürich. (Birkhäuser Verlag, Basel, 2003).
11. M. JERRUM AND A. SINCLAIR, Polynomial-time approximation algorithms for the Ising model, SIAM Journal on Computing, 22:1087-1116, 1993.
12. L. LOVASZ AND R. KANNAN, Faster mixing via average conductance. 31st Annual ACM Symposium on Theory of Computing, pp. 282-287, 1999.
13. N. MADRAS AND D. RANDALL, Markov chain decomposition for convergence rate analysis. Annals of Applied Probability, 12:581-606, 2002.
14. M.W. MAHONEY AND W.L. JORGENSEN, 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.
15. S. MASE, J. MØLLER, D. STOYAN, R.P. WAAGEPETERSEN AND G. DÖGE, Packing Densities and Simulated Tempering for Hard Core Gibbs Point Processes. Annals of the Institute of Statistical Mathematics, 53:661-680, 2001.
16. N. METROPOLIS, A.W. ROSENBLUTH, M.N. ROSENBLUTH, A.H. TELLER AND E. TELLER, Equation of state calculation by fast computing machines. Journal of Chemical Physics, 21:1087-1092, 1953.
17. http://mathworld.wolfram.com.
18. M.E.J. NEWMAN AND G.T. BARKEMA, Monte Carlo Methods in Statistical Physics. (Oxford University Press, Oxford, 1999).
19. D. STOYAN, W.S. KENDALL AND J. MECKE, Stochastic Geometry and Its Applications, 2nd ed. (Wiley, New York, 1995).
20. L. TONKS, The Complete Equation of State of One, Two and Three-Dimensional Gases of Hard Elastic Sphere. Physical Review, 50:955-963, 1936.