Monte Carlo random search techniques

A molecular dynamics simulation samples the phase space of a molecule (defined by the position of the atoms and their velocities) by integrating Newton s equations of motion. Because MD accounts for thermal motion, the molecules simulated may possess enough thermal energy to overcome potential barriers, which makes the technique suitable in principle for conformational analysis of especially large molecules. In the case of small molecules, other techniques such as systematic, random. Genetic Algorithm-based, or Monte Carlo searches may be better suited for effectively sampling conformational space. 

A particular advantage of the low-mode search is that it can be applied to botli cyclic ajic acyclic molecules without any need for special ring closure treatments. As the low-mod> search proceeds a series of conformations is generated which themselves can act as starting points for normal mode analysis and deformation. In a sense, the approach is a system ati( one, bounded by the number of low-frequency modes that are selected. An extension of th( technique involves searching random mixtures of the low-frequency eigenvectors using Monte Carlo procedure. 

Monte Carlo search methods are stochastic techniques based on the use of random numbers and probability statistics to sample conformational space. The name Monte Carlo was originally coined by Metropolis and Ulam [4] during the Manhattan Project of World War II because of the similarity of this simulation technique to games of chance. Today a variety of Monte Carlo (MC) simulation methods are routinely used in diverse fields such as atmospheric studies, nuclear physics, traffic flow, and, of course, biochemistry and biophysics. In this section we focus on the application of the Monte Carlo method for... 

To approximately locate the global minimum i.e., to obtain a good quality crystal structure solution) in a reasonable amount of time, grid search methods should be replaced by the stochastic ones, based on a random sampling of the parameter space. This technique, called Monte Carlo MC), has been widely used in other scientific fields to simulate the behavior of complex systems. Its application to crystal structure determination from powder diffraction data has been developed by many authors the main strategies are outlined below. 

This is an example of a more general technique called Markov chain Monte-Carlo sampling where, instead of exhaustively searching a state space, one starts from a random state and moves through the space in a stochastic fashion such that, in the limit of long time, each state is visited in proportion to its posterior probability. 

Such searches use Monte Carlo techniques, in which adsorbate molecules are inserted with random positions and orientations into the porous host structure. For complex molecular guests, a series of low-energy configurations of... 

Simulated annealing is a global, multivariate optimization technique based on the Metropolis Monte Carlo search algorithm. The method starts from an initial random state, and walks through the state space associated with the problem of interest by generating a series of small, stochastic steps. An objective function maps each state into a value in EH that measures its fitness. In the problem at hand, a state is a unique -membered subset of compounds from the n-membered set, its fitness is the diversity associated with that set, and the step is a small change in the composition of that set (usually of the order of 1-10% of the points comprising the set). While downhill transitions are always accepted, uphill transitions are accepted with a probability that is inversely proportional to... 

---