Exact enumeration of self-avoiding walks
arXiv:1104.2184 · doi:10.1088/1742-5468/2011/06/P06019
Abstract
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 the process thousands or millions of times faster. This allowed us to enumerate self-avoiding walks on the simple cubic lattice up to a length of 36 steps.
6 pages, 1 figure
References in corpus (1)
Cited by in corpus (23)
- High-precision estimate of the hydrodynamic radius for self-avoiding walks
- Logarithmic correction for the susceptibility of the 4-dimensional weakly self-avoiding walk: a renormalisation group analysis
- Calculation of the connective constant for self-avoiding walks via the pivot algorithm
- Critical two-point function of the 4-dimensional weakly self-avoiding walk
- Scale-free Monte Carlo method for calculating the critical exponent of self-avoiding walks
- Construction of Energy Functions for Lattice Heteropolymer Models: A Case Study in Constraint Satisfaction Programming and Adiabatic Quantum Optimization
- Exact enumeration of self-avoiding walks on BCC and FCC lattices
- Self-avoiding walk, spin systems, and renormalization
- Three-dimensional terminally attached self-avoiding walks and bridges
- Solvent-Induced Negative Energetic Elasticity in a Lattice Polymer Chain
- SAWdoubler: a program for counting self-avoiding walks
- Brownian non-Gaussian diffusion of self-avoiding walks
- Asymptotic scaling behavior of self-avoiding walks on critical percolation clusters
- Scaling Analysis of Random Walks with Persistence Lengths: Application to Self-Avoiding Walks
- Endless self-avoiding walks
- Conformal invariance of the 3D self-avoiding walk
- Monte Carlo Simulation of Long Hard-Sphere Polymer Chains in Two to Five Dimensions
- Conformal invariance predictions for the three-dimensional self-avoiding walk
- The entropic pressure of lattice knots
- Numerical estimates of square lattice star vertex exponents
- Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons
- Lattice star and acyclic branched polymer vertex exponents in 3d
- Conformal amplitude hierarchy and the Poincare disk