TY - JOUR
T1 - Multicanonical Monte Carlo ensemble growth algorithm
AU - Vernizzi, Graziano
AU - Nguyen, Trung Dac
AU - Orland, Henri
AU - Olvera De La Cruz, Monica
N1 - Funding Information:
Acknowledgments. G.V., T.D.N., and M.O.d.l.C. are thankful for the support by the National Science Foundation through Grant No. DMR-1611076, and by the Sherman Fairchild Foundation.
Publisher Copyright:
© 2020 American Physical Society.
PY - 2020/2
Y1 - 2020/2
N2 - We present an ensemble Monte Carlo growth method to sample the equilibrium thermodynamic properties of random chains. The method is based on the multicanonical technique of computing the density of states in the energy space. Such a quantity is temperature independent, and therefore microcanonical and canonical thermodynamic quantities, including the free energy, entropy, and thermal averages, can be obtained by reweighting with a Boltzmann factor. The algorithm we present combines two approaches: The first is the Monte Carlo ensemble growth method, where a "population" of samples in the state space is considered, as opposed to traditional sampling by long random walks, or iterative single-chain growth. The second is the flat-histogram Monte Carlo, similar to the popular Wang-Landau sampling, or to multicanonical chain-growth sampling. We discuss the performance and relative simplicity of the proposed algorithm, and we apply it to known test cases.
AB - We present an ensemble Monte Carlo growth method to sample the equilibrium thermodynamic properties of random chains. The method is based on the multicanonical technique of computing the density of states in the energy space. Such a quantity is temperature independent, and therefore microcanonical and canonical thermodynamic quantities, including the free energy, entropy, and thermal averages, can be obtained by reweighting with a Boltzmann factor. The algorithm we present combines two approaches: The first is the Monte Carlo ensemble growth method, where a "population" of samples in the state space is considered, as opposed to traditional sampling by long random walks, or iterative single-chain growth. The second is the flat-histogram Monte Carlo, similar to the popular Wang-Landau sampling, or to multicanonical chain-growth sampling. We discuss the performance and relative simplicity of the proposed algorithm, and we apply it to known test cases.
UR - http://www.scopus.com/inward/record.url?scp=85081965636&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85081965636&partnerID=8YFLogxK
U2 - 10.1103/PhysRevE.101.021301
DO - 10.1103/PhysRevE.101.021301
M3 - Article
C2 - 32168705
AN - SCOPUS:85081965636
SN - 2470-0045
VL - 101
JO - Physical Review E
JF - Physical Review E
IS - 2
M1 - 021301
ER -