Calculation of the connective constant for self-avoiding walks via the pivot algorithm

DOI10.1088/1751-8113/46/24/245001zbMATH Open1269.82027arXiv1302.2106OpenAlexW1963509022MaRDI QIDQ2839458FDOQ2839458

Authors: Nathan Clisby 

Publication date: 11 July 2013

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

Abstract: We calculate the connective constant for self-avoiding walks on the simple cubic lattice to unprecedented accuracy, using a novel application of the pivot algorithm. We estimate that mu = 4.684 039 931(27). Our method also provides accurate estimates of the number of self-avoiding walks, even for walks with millions of steps.

Full work available at URL: https://arxiv.org/abs/1302.2106

Recommendations

• Canonical Monte Carlo determination of the connective constant of self-avoiding walks
• Self-avoiding walks on the simple cubic lattice
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• Self-avoiding walks and polygons on the triangular lattice
• Self-avoiding polygons on the square lattice

zbMATH Keywords

self-avoiding walkscubic latticeMonte Carlo algorithm

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Cited In (19)

• Lattice star and acyclic branched polymer vertex exponents in \(3d\)
• Scale-free Monte Carlo method for calculating the critical exponent \(\gamma\) of self-avoiding walks
• Two-sided prudent walks: a solvable non-directed model of polymer adsorption
• Supermultiplicative relations in models of interacting self-avoiding walks and polygons
• The distribution of first hitting times of randomwalks on Erdős-Rényi networks
• Growing self avoiding walk trees
• Efficient implementation of the Pivot algorithm for self-avoiding walks
• Canonical Monte Carlo determination of the connective constant of self-avoiding walks
• Persistence length convergence and universality for the self-avoiding random walk
• Critical properties of semi-flexible polymer chains situated within the simple cubic lattice
• Lattice polymers near a permeable interface
• Exponential growth rate of lattice comb polymers
• Partition and generating function zeros in adsorbing self-avoiding walks
• New scaling laws for self-avoiding walks: bridges and worms
• Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints
• Critical scaling of lattice polymers confined to a box without endpoint restriction
• Monte Carlo simulation of 3-star lattice polymers pulled from an adsorbing surface
• Brownian non-Gaussian diffusion of self-avoiding walks
• Universal features of complex n-block copolymers

This page was built for publication: Calculation of the connective constant for self-avoiding walks via the pivot algorithm

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