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.
Recommendations
- Algebraic techniques for enumerating self-avoiding walks on the square lattice
- Self-avoiding walk enumeration via the lace expansion
- Exact enumeration of self-avoiding walks on critical percolation clusters in 2-7 dimensions
- Enumeration of self-avoiding walks on the square lattice
- scientific article; zbMATH DE number 5831714
Cites work
Cited in
(31)- Efficient algorithm for computing exact partition functions of lattice polymer models
- Statistical mechanics of polymer chains grafted to adsorbing boundaries of fractal lattices embedded in three-dimensional space
- Counting all unfolded self-avoiding walks on a finite lattice strip of width three
- Logarithmic correction for the susceptibility of the 4-dimensional weakly self-avoiding walk: a renormalisation group analysis
- Conformal invariance predictions for the three-dimensional self-avoiding walk
- Critical two-point function of the 4-dimensional weakly self-avoiding walk
- Monotonicity of the number of self-avoiding walks
- scientific article; zbMATH DE number 6700515 (Why is no real title available?)
- The entropic pressure of lattice knots
- Exact enumeration of self-avoiding walks on BCC and FCC lattices
- Exact enumeration and Monte Carlo results for self-avoiding walks in a slab
- scientific article; zbMATH DE number 1047746 (Why is no real title available?)
- Algebraic techniques for enumerating self-avoiding walks on the square lattice
- A note about the enumeration of self-avoiding walks
- Exact transfer-matrix enumeration and critical behaviour of self-avoiding walks across finite strips
- Lattice star and acyclic branched polymer vertex exponents in 3d
- COUNTING ALL SELF-AVOIDING WALKS ON A FINITE LATTICE STRIP OF WIDTH ONE
- Critical properties of semi-flexible polymer chains situated within the simple cubic lattice
- An upper bound for the bond percolation threshold of the cubic lattice by a growth process approach
- Self-avoiding walk, spin systems and renormalization
- Self-avoiding walk enumeration via the lace expansion
- Exact enumeration of self-avoiding walks on critical percolation clusters in 2-7 dimensions
- Scale-free Monte Carlo method for calculating the critical exponent \(\gamma\) of self-avoiding walks
- A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice
- How to Estimate the Number of Self-Avoiding Walks over 10100? Use Random Walks
- Brownian non-Gaussian diffusion of self-avoiding walks
- Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons
- Enumeration of compact self-avoiding walks
- Accelerating polymer simulation by means of tree data-structures and a parsimonious Metropolis algorithm
- Exponential growth rate of lattice comb polymers
- Exactly-solvable self-trapping lattice walks in ladder graphs
This page was built for publication: Exact enumeration of self-avoiding walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301256)
