Monte Carlo Methods for Lattice Polygons

DOI10.1007/978-1-4020-9927-4_9zbMath1180.82092OpenAlexW2136235363MaRDI QIDQ3651686

E. J. Janse van Rensburg

Publication date: 11 December 2009

Published in: Polygons, Polyominoes and Polycubes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4020-9927-4_9

zbMATH Keywords

Monte Carloself-avoiding walklattice polygons

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correction-to-scaling exponents for two-dimensional self-avoiding walks
• Adaptive umbrella sampling: Self-consistent determination of the non- Boltzmann bias
• A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons.
• Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks.
• Monte Carlo study of the interacting self-avoiding walk model in three dimensions.
• A faster implementation of the pivot algorithm for self-avoiding walks
• Knots in random walks
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
• Multiple Markov chain Monte Carlo study of adsorbing self-avoiding walks in two and in three dimensions
• The pivot algorithm and polygons: results on the FCC lattice
• The knot probability in lattice polygons
• Knots in self-avoiding walks
• Asymptotics of knotted lattice polygons
• Entanglement complexity of graphs in Z³
• The BFACF algorithm and knotted polygons
• Ergodicity of the BFACF algorithm in three dimensions
• THE LACE EXPANSION FOR SELF-AVOIDING WALK IN FIVE OR MORE DIMENSIONS
• Self-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices
• Interacting self-avoiding walks and polygons in three dimensions
• Entropic exponents of lattice polygons with specified knot type
• Canonical Monte Carlo determination of the connective constant of self-avoiding walks
• Size and area of square lattice polygons
• The dimensions of knotted polygons
• Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference
• Self-avoiding polygons on the square lattice
• Collapsing and adsorbing polygons
• Equation of State Calculations by Fast Computing Machines
• Squeezing knots
• Self-avoiding walk enumeration via the lace expansion
• On the Number of Self-Avoiding Walks. II
• On the Number of Self-Avoiding Walks
• The Monte Carlo Method

This page was built for publication: Monte Carlo Methods for Lattice Polygons