Calculation of the connective constant for self-avoiding walks via the pivot algorithm
classification
❄️ cond-mat.stat-mech
math-phmath.COmath.MP
keywords
walksself-avoidingalgorithmconnectiveconstantpivotaccuracyaccurate
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.