Speed-up of Monte Carlo simulations by sampling of rejected states.

The Markov chain Monte Carlo method is an important tool to estimate the average properties of systems with a very large number of accessible states. This technique is used extensively in fields ranging from physics to genetics and economics. The rejection of trial configurations is a central ingredient in existing Markov chain Monte Carlo simulations. I argue that the efficiency of Monte Carlo simulations can be enhanced, sometimes dramatically, by properly sampling configurations that are normally rejected. This "waste-recycling" of microstates is useful in sampling schemes in which only one of a large set of trial configurations is accepted. It differs fundamentally from schemes that extract information about the density of macrostates from virtual Monte Carlo moves. As a simple illustration, I show that the method greatly improves the calculation of the order-parameter distribution of a two-dimensional Ising model. This method should enhance the efficiency of parallel Monte Carlo simulations significantly.

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

[2]  A. Barker.  Monte Carlo calculations of the radial distribution functions for a proton-electron plasma , 1965 .

[3]  C. Fortuin,et al.  On the random-cluster model: I. Introduction and relation to other models , 1972 .

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

[5]  S. Rice,et al.  A lattice model of a supported monolayer of amphiphile molecules: Monte Carlo simulations , 1988 .

[6]  Juan J. de Pablo,et al.  Simulation of polyethylene above and below the melting point , 1992 .

[7]  Daan Frenkel,et al.  Configurational bias Monte Carlo: a new sampling scheme for flexible chains , 1992 .

[8]  Berend Smit,et al.  Novel scheme to study structural and thermal properties of continuously deformable molecules , 1992 .

[9]  Berend Smit,et al.  Understanding molecular simulation: from algorithms to applications , 1996 .

[10]  N. B. Wilding,et al.  An efficient simulation method for multi-polymer systems , 1998 .

[11]  J J de Pablo,et al.  Simulation of phase transitions in fluids. , 1999, Annual review of physical chemistry.

[12]  D. Frenkel,et al.  Recoil growth algorithm for chain molecules with continuous interactions , 1999 .

[13]  Gerard T. Barkema,et al.  Monte Carlo Methods in Statistical Physics , 1999 .

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

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

[16]  K. Binder,et al.  Flat Histogram Method of Wang-Landau and N-fold Way , 2001 .

[17]  R. Swendsen,et al.  Transition Matrix Monte Carlo Method , 2001, cond-mat/0104418.

[18]  FLAT HISTOGRAM METHOD OF WANG–LANDAU AND N-FOLD WAY , 2002 .

[19]  D. Frenkel,et al.  Dynamic pruned-enriched Rosenbluth method , 2003 .

[20]  P. G. Debenedetti,et al.  An improved Monte Carlo method for direct calculation of the density of states , 2003 .

[21]  Erik Luijten,et al.  Rejection-free geometric cluster algorithm for complex fluids. , 2004, Physical review letters.