Dynamics for the Mean-field Random-cluster Model
暂无分享,去创建一个
[1] Christian Borgs,et al. Tight bounds for mixing of the Swendsen–Wang algorithm at the Potts transition point , 2010, ArXiv.
[2] Béla Bollobás,et al. Random Graphs , 1985 .
[3] V. Beara. The self-dual point of the two-dimensional random-cluster model is critical for q > 1 , 2011 .
[4] Mario Ullrich,et al. Rapid mixing of Swendsen-Wang and single-bond dynamics in two dimensions , 2012, ArXiv.
[5] G. Grimmett,et al. The random-cluster model on the complete graph , 1996 .
[6] Jonathan Machta,et al. GRAPHICAL REPRESENTATIONS AND CLUSTER ALGORITHMS II , 1998 .
[7] A. Sokal,et al. Generalization of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm. , 1988, Physical review. D, Particles and fields.
[8] Mario Ullrich,et al. Swendsen-Wang Is Faster than Single-Bond Dynamics , 2012, SIAM J. Discret. Math..
[9] Paul Cuff,et al. Glauber Dynamics for the Mean-Field Potts Model , 2012, 1204.4503.
[10] Svante Janson,et al. Susceptibility in subcritical random graphs , 2008, 0806.0252.
[11] Eric Vigoda,et al. Swendsen‐Wang algorithm on the mean‐field Potts model , 2015, APPROX-RANDOM.
[12] E. Kreyszig. Introductory Functional Analysis With Applications , 1978 .
[13] C. Fortuin,et al. On the random-cluster model: I. Introduction and relation to other models , 1972 .
[14] Tomasz Luczak,et al. The phase transition in the cluster‐scaled model of a random graph , 2006, Random Struct. Algorithms.
[15] Remco van der Hofstad,et al. Random Graphs and Complex Networks , 2016, Cambridge Series in Statistical and Probabilistic Mathematics.
[16] Asaf Nachmias,et al. A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics , 2011 .
[17] Alistair Sinclair,et al. Dynamics for the Mean-field Random-cluster Model , 2014, APPROX-RANDOM.
[18] Geoffrey Grimmett. The Random-Cluster Model , 2002, math/0205237.
[19] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[20] Qi Ge,et al. A Graph Polynomial for Independent Sets of Bipartite Graphs , 2009, Combinatorics, Probability and Computing.
[21] G. Kirchhoff. Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .
[22] Eric Vigoda,et al. Swendsen-Wang Algorithm on the Mean-Field , 2015 .
[23] R. Durrett. Probability: Theory and Examples , 1993 .
[24] Martin Dyer,et al. Mixing properties of the Swendsen–Wang process on the complete graph and narrow grids , 2000 .
[25] F. Martinelli. Rapid mixing of Swendsen-Wang dynamics in two dimensions , 2012 .
[26] Mark Huber,et al. A bounding chain for Swendsen‐Wang , 2003, Random Struct. Algorithms.
[27] V. Climenhaga. Markov chains and mixing times , 2013 .
[28] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .
[29] Mark Jerrum,et al. The Swendsen-Wang process does not always mix rapidly , 1997, STOC '97.
[30] Alan M. Frieze,et al. Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[31] G. Grimmett,et al. Probability and random processes , 2002 .
[32] Wang,et al. Nonuniversal critical dynamics in Monte Carlo simulations. , 1987, Physical review letters.