Persistence length convergence and universality for the self-avoiding random walk

DOI10.1088/1751-8121/aaeeb0zbMath1506.82014OpenAlexW2899835004WikidataQ128980765 ScholiaQ128980765MaRDI QIDQ5051130

No author found.

Publication date: 18 November 2022

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1751-8121/aaeeb0

zbMATH Keywords

pivot algorithmself-avoiding walkpersistence length

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Related Items

Persistence length of semi-flexible polymer chains on Euclidean lattices

Cites Work

• Correction-to-scaling exponents for two-dimensional self-avoiding walks
• Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks.
• A faster implementation of the pivot algorithm for self-avoiding walks
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• Texture analysis and classification using deterministic tourist walk
• Self-testing algorithms for self-avoiding walks
• Heat kernal expansion coefficient. I. An extension
• The persistence length of two-dimensional self-avoiding random walks
• The statistical mechanics of polymers with excluded volume
• Unnamed Item
• Unnamed Item
• Unnamed Item