𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Markov chain algorithms for canonical ensemble simulation

✍ Scribed by M. Krajčí

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
632 KB
Volume
42
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

✦ Synopsis

Detailed algorithms of two Markov chain methods -MC2 and MC2R -for the canonical ensemble simulation are presented. The methods are compared with the Metropolis Monte Carlo (MMC) method and the molecular dynamics method. For equilibrium states the algorithm MC2R is more efficient than the algorithm MMC. The molecular dynamics method allows larger average displacements of atoms per time step than the Markov chain methods. The algorithm MC2 can also work very efficiently as an algorithm for minimizing the total potential energy of the system.

📜 SIMILAR VOLUMES

An algorithm for determination of the co
An algorithm for determination of the copolymer molecular weight distribution by Markov chain simulation
✍ Latchezar Christov; George Georgiev 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 616 KB

A simple and general algorithm, convenient for computer implementation, for calculation of the copolymer molecular weight distribution (MWD), its moments, copolymer composition, etc. from standard data has been developed describing copolymerization as a Markovian process. The algorithm is applicable

Simple Markov-chain algorithms for gener
Simple Markov-chain algorithms for generating bipartite graphs and tournaments
✍ Ravi Kannan; Prasad Tetali; Santosh Vempala 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB 👁 2 views

We consider two problems: randomly generating labeled bipartite graphs with a given degree sequence and randomly generating labeled tournaments with a given score sequence. We analyze simple Markov chains for both problems. For the first problem, we cannot prove that our chain is rapidly mixing in g

General over-relaxation Markov chain Mon
General over-relaxation Markov chain Monte Carlo algorithms for Gaussian densities
✍ Piero Barone; Giovanni Sebastiani; Julian Stander 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 128 KB

We study general over-relaxation Markov chain Monte Carlo samplers for multivariate Gaussian densities. We provide conditions for convergence based on the spectral radius of the transition matrix and on detailed balance. We illustrate these algorithms using an image analysis example.