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

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 μ= 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.

10 pages, 3 figures

References in corpus (4)

• Accurate estimate of the critical exponent $\nu$ for self-avoiding walks via a fast implementation of the pivot algorithm
• A new transfer-matrix algorithm for exact enumerations: Self-avoiding polygons on the square lattice
• Lectures on Self-Avoiding Walks
• Exactly solved models of polyominoes and polygons

Cited by in corpus (23)

• High-precision estimate of the hydrodynamic radius for self-avoiding walks
• Scale-free Monte Carlo method for calculating the critical exponent $\gamma$ of self-avoiding walks
• Hopping conductivity and insulator-metal transition in films of touching semiconductor nanocrystals
• Three-dimensional terminally attached self-avoiding walks and bridges
• Parallel PERM
• The distribution of first hitting times of random walks on Erdős-Rényi networks
• Brownian non-Gaussian diffusion of self-avoiding walks
• GPU implementation of the Rosenbluth generation method for static Monte Carlo simulations
• Endless self-avoiding walks
• Random Polymers and Generalized Urn Processes
• Partition and generating function zeros in adsorbing self-avoiding walks
• A solvable non-directed model of polymer adsorption
• Long Polymers Near Wedges and Cones
• Energy of the Interacting Self-Avoiding Walk at the $\theta -$point
• Numerical estimates of square lattice star vertex exponents
• Random knotting in very long off-lattice self-avoiding polygons
• Lattice star and acyclic branched polymer vertex exponents in 3d
• Supermultiplicative relations in models of interacting self-avoiding walks and polygons
• Lattice polymers near a permeable interface
• Upper bounds for the connective constant of weighted self-avoiding walks
• Critical scaling of lattice polymers confined to a box without endpoint restriction
• Equilibrium Energy and Entropy of Vortex Filaments on a Cubic Lattice: A Localized Transformations Algorithm
• Entropic exponents of grafted lattices stars