A Monte Carlo algorithm for lattice ribbons.

DOI10.1007/BF02179807zbMath1042.82553MaRDI QIDQ1593362

E. J. Janse van Rensburg, Enzo Orlandini, Stuart G. Whittington

Publication date: 16 January 2001

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

Mathematics Subject Classification ID

Related Items (3)

Phase diagram of twist storing lattice polymers in variable solvent quality ⋮ Statistical topology of closed curves: Some applications in polymer physics ⋮ Entanglement complexity of lattice ribbons

Cites Work

• Unnamed Item
• Unnamed Item
• Exponential convergence to equilibrium for a class of random-walk models
• Linking numbers, contacts, and mutual inductances of a random set of closed curves
• Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional 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.
• Critical exponents from field theory
• The distribution of Alexander polynomials of knots confined to a thin layer
• The knot probability in lattice polygons
• On the topology of a polymer ring
• Knots in self-avoiding walks
• The BFACF algorithm and knotted polygons
• The writhe of a self-avoiding polygon
• Random linking of lattice polygons
• Knot probability for lattice polygons in confined geometries
• Self-Linking and the Gauss Integral in Higher Dimensions

This page was built for publication: A Monte Carlo algorithm for lattice ribbons.