Comparison of Swendsen‐Wang and heat‐bath dynamics
暂无分享,去创建一个
[1] F. Martinelli. Dynamical analysis of low-temperature monte carlo cluster algorithms , 1992 .
[2] Mark Jerrum,et al. The Swendsen-Wang process does not always mix rapidly , 1997, STOC '97.
[3] Geoffrey Grimmett. The Random-Cluster Model , 2002, math/0205237.
[4] K. Alexander,et al. On weak mixing in lattice models , 1998 .
[5] P. Diaconis,et al. LOGARITHMIC SOBOLEV INEQUALITIES FOR FINITE MARKOV CHAINS , 1996 .
[6] Li,et al. Rigorous lower bound on the dynamic critical exponents of the Swendsen-Wang algorithm. , 1989, Physical review letters.
[7] Christian Borgs,et al. Tight bounds for mixing of the Swendsen–Wang algorithm at the Potts transition point , 2010, ArXiv.
[8] P. Diaconis,et al. COMPARISON THEOREMS FOR REVERSIBLE MARKOV CHAINS , 1993 .
[9] Yuval Peres,et al. Glauber dynamics on trees and hyperbolic graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[10] Thomas P. Hayes. A simple condition implying rapid mixing of single-site dynamics on spin systems , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[11] Evdokia Nikolova,et al. On the Hardness and Smoothed Complexity of Quasi-Concave Minimization , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[12] Wang,et al. Nonuniversal critical dynamics in Monte Carlo simulations. , 1987, Physical review letters.
[13] V. Climenhaga. Markov chains and mixing times , 2013 .
[14] R. Parviainen. Probability on graphs , 2002 .
[15] Allan Sly,et al. Critical Ising on the Square Lattice Mixes in Polynomial Time , 2010, 1001.1613.
[16] Alan M. Frieze,et al. Mixing properties of the Swendsen-Wang process on classes of graphs , 1999, Random Struct. Algorithms.
[17] F. Toninelli,et al. On the Mixing Time of the 2D Stochastic Ising Model with “Plus” Boundary Conditions at Low Temperature , 2009, 0905.3040.
[18] Yuval Peres,et al. Mixing Time Power Laws at Criticality , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[19] C. Fortuin,et al. On the random-cluster model: I. Introduction and relation to other models , 1972 .
[20] Martin Dyer,et al. Mixing properties of the Swendsen–Wang process on the complete graph and narrow grids , 2000 .
[21] Mark Huber,et al. A bounding chain for Swendsen‐Wang , 2003, Random Struct. Algorithms.
[22] Geoffrey Grimmett,et al. Probability on Graphs: Frontmatter , 2010 .
[23] F. Martinelli. Lectures on Glauber dynamics for discrete spin models , 1999 .
[24] A. Frieze,et al. Mixing properties of the Swendsen-Wang process on classes of graphs , 1999 .
[25] F. Martinelli,et al. For 2-D lattice spin systems weak mixing implies strong mixing , 1994 .
[26] F. Martinelli,et al. Approach to equilibrium of Glauber dynamics in the one phase region , 1994 .
[27] A. Sokal,et al. Generalization of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm. , 1988, Physical review. D, Particles and fields.