Exact enumeration of self-avoiding walks

DOI10.1088/1742-5468/2011/06/P06019zbMATH Open1456.82448arXiv1104.2184OpenAlexW3105416693MaRDI QIDQ3301256FDOQ3301256

Authors: G. T. Barkema, R. H. Bisseling, Raoul D. Schram 

Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1104.2184

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

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Critical phenomena in equilibrium statistical mechanics (82B27)

Cites Work

• A course in combinatorics.
• Title not available (Why is that?)
• Self-avoiding walk enumeration via the lace expansion
• Enumeration of self-avoiding walks on the square lattice
• Self-avoiding walks on the simple cubic lattice

Cited In (28)

• Self-avoiding walk enumeration via the lace expansion
• Conformal invariance predictions for the three-dimensional self-avoiding walk
• Self-avoiding walk, spin systems and renormalization
• Exact enumeration and Monte Carlo results for self-avoiding walks in a slab
• Exact transfer-matrix enumeration and critical behaviour of self-avoiding walks across finite strips
• How to Estimate the Number of Self-Avoiding Walks over 10100? Use Random Walks
• Exact enumeration of self-avoiding walks on BCC and FCC lattices
• Exact enumeration of self-avoiding walks on critical percolation clusters in 2–7 dimensions
• Algebraic techniques for enumerating self-avoiding walks on the square lattice
• 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
• An upper bound for the bond percolation threshold of the cubic lattice by a growth process approach
• Logarithmic correction for the susceptibility of the 4-dimensional weakly self-avoiding walk: a renormalisation group analysis
• Critical two-point function of the 4-dimensional weakly self-avoiding walk
• Critical properties of semi-flexible polymer chains situated within the simple cubic lattice
• COUNTING ALL SELF-AVOIDING WALKS ON A FINITE LATTICE STRIP OF WIDTH ONE
• The entropic pressure of lattice knots
• Exponential growth rate of lattice comb polymers
• Accelerating polymer simulation by means of tree data-structures and a parsimonious Metropolis algorithm
• A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice
• Lattice star and acyclic branched polymer vertex exponents in 3d
• Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons
• A note about the enumeration of self-avoiding walks
• Scale-free Monte Carlo method for calculating the critical exponentγof self-avoiding walks
• Monotonicity of the number of self-avoiding walks
• Title not available (Why is that?)
• Brownian non-Gaussian diffusion of self-avoiding walks
• Enumeration of compact self-avoiding walks

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)