Efficiency of the incomplete enumeration algorithm for Monte-Carlo simulation of linear and branched polymers

DOI10.1007/S10955-005-5462-2MaRDI QIDQ2481422zbMATH OpenOpenAlexFDO

Authors Sumedha, Deepak Dhar

Publication date 9 April 2008

Published in Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cond-mat/0408640

zbMATH Keywords

lattice animalsMonte-Carlo methods for polymerspercolation on treesself-avoiding walks

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Percolation (82B43) Statistical mechanics of polymers (82D60)

Abstract: We study the efficiency of the incomplete enumeration algorithm for linear and branched polymers. There is a qualitative difference in the efficiency in these two cases. The average time to generate an independent sample of $n$ sites for large $n$ varies as $n^2$ for linear polymers, but as $exp(c{n}^{alpha})$ for branched (undirected and directed) polymers, where $0<alpha<1$. On the binary tree, our numerical studies for $n$ of order $10^4$ gives $alpha=0.333pm0.005$. We argue that $alpha=1/3$ exactly in this case.

Recommendations

• Computer simulations of randomly branching polymers: annealed versus quenched branching structures
• A review of Monte Carlo simulations of polymers with PERM
• Simulations of lattice animals and trees
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• Efficient algorithm for computing exact partition functions of lattice polymer models

Cites work

• A faster implementation of the pivot algorithm for self-avoiding walks
• A nonlocal Monte Carlo algorithm for lattice trees
• Enumerations of lattice animals and trees
• Front propagation into unstable states
• Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
• Self-avoiding polygons on the square lattice
• Simulations of lattice animals and trees
• The pivot algorithm and polygons: results on the FCC lattice
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.

Cited in

(4)

• The two dimensional shapes of simple three and four junction ideal comb polymers
• Rooted spiral trees on hyper-cubic lattices
• Implementation and performance analysis of bridging Monte Carlo moves for off-lattice single chain polymers in globular states
• A recursive method to calculate the expected molecule numbers for a polymerization network with a small number of subunits

This page was built for publication: Efficiency of the incomplete enumeration algorithm for Monte-Carlo simulation of linear and branched polymers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481422)