Markov chain Monte Carlo method without detailed balance.

We present a specific algorithm that generally satisfies the balance condition without imposing the detailed balance in the Markov chain Monte Carlo. In our algorithm, the average rejection rate is minimized, and even reduced to zero in many relevant cases. The absence of the detailed balance also introduces a net stochastic flow in a configuration space, which further boosts up the convergence. We demonstrate that the autocorrelation time of the Potts model becomes more than 6 times shorter than that by the conventional Metropolis algorithm. Based on the same concept, a bounce-free worm algorithm for generic quantum spin models is formulated as well.

[1]  A. Sandvik,et al.  Quantum Monte Carlo with directed loops. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  L. Tierney.  Markov Chains for Exploring Posterior Distributions , 1994 .

[4]  Lana,et al.  Cluster algorithm for vertex models. , 1993, Physical review letters.

[5]  K. Hukushima,et al.  Exchange Monte Carlo Method and Application to Spin Glass Simulations , 1995, cond-mat/9512035.

[6]  S. Duane,et al.  Hybrid Monte Carlo , 1987 .

[7]  Stefan Wessel,et al.  Generalized directed loop method for quantum Monte Carlo simulations. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Michael W. Deem,et al.  Strict detailed balance is unnecessary in Monte Carlo simulation , 1999 .

[9]  A. Honecker,et al.  The ALPS project release 1.3: Open-source software for strongly correlated systems , 2007 .

[10]  K. Binder,et al.  A Guide to Monte Carlo Simulations in Statistical Physics , 2000 .

[11]  S. Adler.  Over-relaxation method for the Monte Carlo evaluation of the partition function for multiquadratic actions , 1981 .

[12]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[13]  Wang,et al.  Nonuniversal critical dynamics in Monte Carlo simulations. , 1987, Physical review letters.

[14]  Christian P. Robert,et al.  Monte Carlo Statistical Methods , 2005, Springer Texts in Statistics.

[15]  K. Pearson,et al.  Biometrika , 1902, The American Naturalist.

[16]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[17]  Peter Green,et al.  Markov chain Monte Carlo in Practice , 1996 .

[18]  Ericka Stricklin-Parker,et al.  Ann , 2005 .

[19]  Optimal Monte Carlo updating. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Radford M. Neal,et al.  ANALYSIS OF A NONREVERSIBLE MARKOV CHAIN SAMPLER , 2000 .

[21]  Berg,et al.  Multicanonical ensemble: A new approach to simulate first-order phase transitions. , 1992, Physical review letters.

[22]  S. Todo,et al.  Cluster algorithms for general-S quantum spin systems. , 2001, Physical review letters.

[23]  Michael Creutz,et al.  Monte Carlo Study of Quantized SU(2) Gauge Theory , 1980 .

[24]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[25]  I. S. Tupitsyn,et al.  Exact, complete, and universal continuous-time worldline Monte Carlo approach to the statistics of discrete quantum systems , 1997, cond-mat/9703200.

[26]  Jun S. Liu,et al.  Metropolized independent sampling with comparisons to rejection sampling and importance sampling , 1996, Stat. Comput..

[27]  F. Y. Wu.  The Potts model , 1982 .