Topic
Monte Carlo molecular modeling
About: Monte Carlo molecular modeling is a research topic. Over the lifetime, 11307 publications have been published within this topic receiving 409122 citations.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This work fits the unnormalized probability of the physical model to a feedforward neural network and reinterpret the architecture as a restricted Boltzmann machine, utilizing its feature detection ability for efficient Monte Carlo updates and to speed up the simulation of the original physical system.
Abstract: Despite their exceptional flexibility and popularity, Monte Carlo methods often suffer from slow mixing times for challenging statistical physics problems. We present a general strategy to overcome this difficulty by adopting ideas and techniques from the machine learning community. We fit the unnormalized probability of the physical model to a feed-forward neural network and reinterpret the architecture as a restricted Boltzmann machine. Then, exploiting its feature detection ability, we utilize the restricted Boltzmann machine to propose efficient Monte Carlo updates to speed up the simulation of the original physical system. We implement these ideas for the Falicov-Kimball model and demonstrate an improved acceptance ratio and autocorrelation time near the phase transition point.
245 citations
••
TL;DR: In this article, a new Monte Carlo algorithm for the simulation of atomistically detailed polymer melts is presented, where the connectivity of the polymer is altered in Monte Carlo moves that satisfy the detailed constraints of molecular geometry.
Abstract: A new Monte Carlo algorithm for the simulation of atomistically detailed polymer melts is presented. The method introduces connectivity relationships as variables in the description of the polymer. The connectivity of the polymer is altered in Monte Carlo moves that satisfy the detailed constraints of molecular geometry. Connectivity-altering moves are seen to induce large jumps in the configuration space of the bulk polymer, thereby greatly enhancing the efficiency with which molecular configurations are sampled. Simulations are carried out in a semigrand ensemble in which the chain length distribution is controlled by a spectrum of chemical potentials. Limiting chain length distributions are derived and compared with simulation results. Volumetric and structural predictions of the method are found to be in agreement with previous work.
244 citations
•
20 May 2013
TL;DR: In the last three decades, there has been a dramatic increase in the use of interacting particle methods as a powerful tool in real-world applications of Monte Carlo simulation in computational physics, population biology, computer sciences, and statistical machine learning.
Abstract: In the last three decades, there has been a dramatic increase in the use of interacting particle methods as a powerful tool in real-world applications of Monte Carlo simulation in computational physics, population biology, computer sciences, and statistical machine learning. Ideally suited to parallel and distributed computation, these advanced particle algorithms include nonlinear interacting jump diffusions; quantum, diffusion, and resampled Monte Carlo methods; Feynman-Kac particle models; genetic and evolutionary algorithms; sequential Monte Carlo methods; adaptive and interacting Markov chain Monte Carlo models; bootstrapping methods; ensemble Kalman filters; and interacting particle filters.
244 citations
••
TL;DR: The Monte Carlo EM (MCEM) algorithm is a modification of the EM algorithm where the expectation in the E-step is computed numerically through Monte Carlo simulations and an automated rule is applied for increasing the Monte Carlo sample size whenthe Monte Carlo error overwhelms the EM estimate at any given iteration.
Abstract: The Monte Carlo EM (MCEM) algorithm is a modification of the EM algorithm where the expectation in the E-step is computed numerically through Monte Carlo simulations. The most exible and generally applicable approach to obtaining a Monte Carlo sample in each iteration of an MCEM algorithm is through Markov chain Monte Carlo (MCMC) routines such as the Gibbs and Metropolis–Hastings samplers. Although MCMC estimation presents a tractable solution to problems where the E-step is not available in closed form, two issues arise when implementing this MCEM routine: (1) how do we minimize the computational cost in obtaining an MCMC sample? and (2) how do we choose the Monte Carlo sample size? We address the first question through an application of importance sampling whereby samples drawn during previous EM iterations are recycled rather than running an MCMC sampler each MCEM iteration. The second question is addressed through an application of regenerative simulation. We obtain approximate independent and identi...
243 citations
••
TL;DR: The details of an application of the method of maximum entropy to the extraction of spectral and transport properties from the imaginary-time correlation functions generated from quantum Monte Carlo simulations of the nondegenerate, symmetric, single-impurity Anderson model are reported.
Abstract: We report the details of an application of the method of maximum entropy to the extraction of spectral and transport properties from the imaginary-time correlation functions generated from quantum Monte Carlo simulations of the nondegenerate, symmetric, single-impurity Anderson model. We find that these physical properties are approximately universal functions of temperature and frequency when these parameters are scaled by the Kondo temperature. We also found that important details for successful extractions included the generation of statistically independent, Gaussian-distributed data, and a good choice of a default model to represent the state of our prior knowledge about the result in the absence of data. We suggest that our techniques are not restricted to the Hamiltonian and quantum Monte Carlo algorithm used here, but that maximum entropy and these techniques lay the general groundwork for the extraction of dynamical information from imaginary-time data generated by other quantum Monte Carlo simulations.
242 citations