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

@article{Clisby2013CalculationOT,
  title={Calculation of the connective constant for self-avoiding walks via the pivot algorithm},
  author={Nathan Clisby},
  journal={Journal of Physics A: Mathematical and Theoretical},
  year={2013},
  volume={46}
}
  • N. Clisby
  • Published 8 February 2013
  • Computer Science
  • Journal of Physics A: Mathematical and Theoretical
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 ± 0.000 000 027. Our method also provides accurate estimates of the number of self-avoiding walks, even for walks with millions of steps. 
View on IOP Publishing
arxiv.org
28 Citations
Highly Influential Citations
2
Background Citations
8
Methods Citations
6
Results Citations
2

28 Citations

Count ing sel f -avoiding walks on the hexagonal lat t ice

In how many ways can you go for a walk along a lattice grid in such a way that you never meet your own trail? In this snapshot, we describe some combinatorial and statistical aspects of these…

Endless self-avoiding walks

We introduce a self-avoiding walk model for which end-effects are completely eliminated. We enumerate the number of these walks for various lattices in dimensions two and three, and use these…

Three-dimensional terminally attached self-avoiding walks and bridges

We study terminally attached self-avoiding walks (SAWs) and bridges on the simple cubic lattice, both by series analysis and Monte Carlo methods. We provide strong numerical evidence supporting a…

Supermultiplicative relations in models of interacting self-avoiding walks and polygons

Fekete’s lemma shows the existence of limits in subadditive sequences. This lemma, and generalisations of it, also have been used to prove the existence of thermodynamic limits in statistical…

High-precision estimate of the hydrodynamic radius for self-avoiding walks.

A method of analysis which eliminates the leading correction to scaling results in a highly accurate estimate for the Flory exponent, and improved estimates for other universal properties that measure the chain dimension.

Partition and generating function zeros in adsorbing self-avoiding walks

The Lee–Yang theory of adsorbing self-avoiding walks is presented. It is shown that Lee–Yang zeros of the generating function of this model asymptotically accumulate uniformly on a circle in the…

New scaling laws for self-avoiding walks: bridges and worms

We show how the theory of the critical behaviour of d-dimensional polymer networks gives a scaling relation for self-avoiding bridges that relates the critical exponent for bridges to that of…

Partition and generating function zeros in adsorbing self-avoiding walks

The Lee-Yang theory of adsorbing self-avoiding walks is presented. It is shown that Lee-Yang zeros of the generating function of this model asymptotically accumulate uniformly on a circle in the…

Growing self avoiding walk trees

The Growing self avoiding walk model (GSAW) was proposed to explain statistical mechanics of the growth process in polymerization. Close examination of the model reveals that it is suited only for…

Critical scaling of lattice polymers confined to a box without endpoint restriction

We study self-avoiding walks on the square lattice restricted to a square box of side L weighted by a length fugacity without restriction of their end points. This is a natural model of a confined…

References

SHOWING 1-10 OF 24 REFERENCES

Accurate estimate of the critical exponent nu for self-avoiding walks via a fast implementation of the pivot algorithm.

A fast implementation of the pivot algorithm for self-avoiding walks is introduced, which is used to obtain large samples of walks on the cubic lattice of up to 33x10{6} steps, and the critical exponent nu is determined to great accuracy.

Exact enumeration of self-avoiding walks

A prototypical problem on which techniques for exact enumeration are tested and compared is the enumeration of self-avoiding walks. Here, we show an advance in the methodology of enumeration, making…

Efficient Implementation of the Pivot Algorithm for Self-avoiding Walks

The pivot algorithm for self-avoiding walks has been implemented in a manner which is dramatically faster than previous implementations, enabling extremely long walks to be efficiently simulated, and promises to be widely useful.

Join- and-cut algorithm for self-avoiding walks with variable length and free endpoints

A new Monte Carlo algorithm for generating self-avoiding walks of variable length and free endpoints that allows high-precision estimation of the critical exponentγ and analyzes the dynamic critical behavior of the new algorithm.

Scaling of the atmosphere of self-avoiding walks

The number of free sites next to the end of a self-avoiding walk is known as the atmosphere of the walk. The average atmosphere can be related to the number of configurations. Here we study the…

Self-avoiding walk enumeration via the lace expansion

We introduce a new method for the enumeration of self-avoiding walks based on the lace expansion. We also introduce an algorithmic improvement, called the two-step method, for self-avoiding walk…

The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk

This paper finds that the pivot algorithm is extraordinarily efficient: one “effectively independent” sample can be produced in a computer time of orderN, and presents a rigorous proof of ergodicity and numerical results on self-avoiding walks in two and three dimensions.

Canonical Monte Carlo determination of the connective constant of self-avoiding walks

We define a statistic an(w), the size of the atmosphere of a self-avoiding walk, w, of length n, with the property that an(w) → μ as n → ∞, where μ is the growth constant of lattice self-avoiding…

Generating functions for enumerating self-avoiding rings on the square lattice

It is shown that generating function techniques provide an efficient means of enumerating the number of self-avoiding rings (polygons) on the square lattice. The techniques can be applied to a number…

A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice

The new algorithm is used to extend the enumeration of polygons to length 130 from the previous record of 110 and shows significant improvement in the running time of the algorithm.