Enumeration of self-avoiding walks on the square lattice
From MaRDI portal
Publication:3159925
DOI10.1088/0305-4470/37/21/002zbMath1058.82009arXivcond-mat/0404728MaRDI QIDQ3159925
Publication date: 1 February 2005
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/0404728
60K35: Interacting random processes; statistical mechanics type models; percolation theory
82B41: Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics
82-04: Software, source code, etc. for problems pertaining to statistical mechanics
Related Items
Sequential stratified splitting for efficient Monte Carlo integration, The interpolation between random walk and self-avoiding walk by avoiding marked sites, Two-dimensional interacting self-avoiding walks: new estimates for critical temperatures and exponents, Exact enumeration of self-avoiding walks on critical percolation clusters in 2–7 dimensions, Scale-free Monte Carlo method for calculating the critical exponentγof self-avoiding walks, Self-avoiding walks contained within a square, Critical loop gases and the worm algorithm, Parallel algorithm for calculation of the exact partition function of a lattice polymer, Series analysis of a Kosterlitz-Thouless transition: the 6-state planar Potts model, Modeling force-induced bio-polymer unfolding, Efficient algorithm for computing exact partition functions of lattice polymer models, The Hammersley-Welsh bound for self-avoiding walk revisited, Transfer matrix algorithm for computing the exact partition function of a square lattice polymer, Counting all unfolded self-avoiding walks on a finite lattice strip of width three, Spatial mixing and the connective constant: optimal bounds, Improved model for mixtures of polymers and hard spheres, ALGEBRAIC AND GEOMETRIC PROPERTIES OF LATTICE WALKS WITH STEPS OF EQUAL LENGTH, Exact enumeration of self-avoiding walks, Partition and generating function zeros in adsorbing self-avoiding walks, Polygons and the Lace Expansion
