1 / 10

Schematic representation of ‘Microstates’.

Integretion over a Markovian Web. G. C. Boulougouris, D. Frenkel, J. Chem. Theory Comput. 2005 , 1, 389-393. Schematic representation of ‘Microstates’. Monte Carlo generate a Markovian chain between ‘Microstates’. Each Microstate is a point in a 3N dimensional phase-space defined

shauna
Download Presentation

Schematic representation of ‘Microstates’.

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Integretion over a Markovian Web. G. C. Boulougouris, D. Frenkel, J. Chem. Theory Comput.2005, 1, 389-393 Schematic representation of ‘Microstates’.

  2. Monte Carlo generate a Markovian chain between ‘Microstates’. Each Microstate is a point in a 3N dimensional phase-space defined By the positions of all “particle” of the system.

  3. Monte Carlo generate a Markovian chain between ‘Microstates’.

  4. Monte Carlo generate a Markovian chain between ‘Microstates’. • Each point in a Markov-Chain depends only on the previous point whereas the overall probability of visiting each point is proportional to the imposed sampling probability (i.e Boltzmann statistics). Monte Carlo algorithms traditionally construct a Markov-Chain using two steps: • Monte Carlo algorithms traditionally construct a Markov-Chain using two steps: • Starting from the current (‘old’) state (o) a trial move is attempted to a new state (n) according to a trial probability ( a ) • The trial state created in the former step is then accepted or rejected according to an acceptance rule that ensures “detailed balance” (or at least the less strict “balance”) between sampled states.

  5. Monte Carlo generate a Markovian chain between ‘Microstates’.

  6. Εvaluation of ensample averages.

  7. Εvaluation of ensample averages. The above equation is exact and in principle is sufficient to describe how the expectation value of a property can be evaluated by combining important sampling and integration over the local states of a Markovian Web (i.e for every state m sampled via important sampling an integration is performed over all n states for which ). G. C. Boulougouris, D. Frenkel, J. Chem. Theory Comput.2005, 1, 389-393

  8. Performing the integration of microstates according to the underlining transition matrix The fact that the diagonal elements of our transition matrix are not defined in the same manner as the off-diagonal elements (since a transition from state m to each self is performed whenever a trail attempt to an other phase is rejected), indicates that the summation maybe broken in two terms.

  9. Expression of the sum as a weighted average over the trail probability Using the same transition matrix to generates the important sampling and to perform the integration over neighboring microstates:

  10. Same applications Enrichment of ensample averages by including all possible events in a trail move with more than one outcome. Combining more than one move e.g. a local and a non local move and enrich the ensemble average will all possible outcomes. Boulougouris G., D. Frenkel, J.Chem.Phys, accepted for publication (2005). ParallelMonte Carlo : Τ2 Τ1 Τ2 Τ1 Boulougouris G., D. Frenkel, J. Chem. Theory Comput.2005, 1, 389-393 Boulougouris G., D. Frenkel, J. Chem. Theory Comput.2005, 1, 389-393

More Related