Self-avoiding walk enumeration via the lace expansion

DOI10.1088/1751-8113/40/36/003zbMath1136.82020OpenAlexW1963845823MaRDI QIDQ5308764

Richard Liang, Nathan Clisby, Gordon Slade

Publication date: 8 October 2007

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e1bd9715fe28fd0f2534b04ca30eba321c90cbce

zbMATH Keywords

polygonlace expansionself-avoiding walk

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Related Items (22)

GENERALIZED ATMOSPHERIC SAMPLING OF KNOTTED POLYGONS ⋮ Statistical topology and knotting of fluctuating filaments ⋮ Efficient algorithm for computing exact partition functions of lattice polymer models ⋮ Scale-free Monte Carlo method for calculating the critical exponentγof self-avoiding walks ⋮ Self‐avoiding walk on the hypercube ⋮ Unlacing hypercube percolation: a survey ⋮ The distribution of first hitting times of randomwalks on Erdős–Rényi networks ⋮ Critical properties of semi-flexible polymer chains situated within the simple cubic lattice ⋮ Exact enumeration of self-avoiding walks ⋮ Exact enumeration of self-avoiding walks on BCC and FCC lattices ⋮ Polymers with spatial or topological constraints: theoretical and computational results ⋮ THE LINKING PROBABILITY FOR 2-COMPONENT LINKS WHICH SPAN A LATTICE TUBE ⋮ Monte Carlo study of four-dimensional self-avoiding walks of up to one billion steps ⋮ Lattice Polygons and Related Objects ⋮ Polygons and the Lace Expansion ⋮ Exact Enumerations ⋮ Monte Carlo Methods for Lattice Polygons ⋮ Appendix: Series Data and Growth Constant, Amplitude and Exponent Estimates ⋮ Expansion in High Dimension for the Growth Constants of Lattice Trees and Lattice Animals ⋮ Self-avoiding walk, spin systems and renormalization ⋮ Brownian non-Gaussian diffusion of self-avoiding walks ⋮ Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons

This page was built for publication: Self-avoiding walk enumeration via the lace expansion