On the Number of Self-Avoiding Walks. II
From MaRDI portal
Publication:5543874
DOI10.1063/1.1704216zbMATH Open0161.37402OpenAlexW2268017341MaRDI QIDQ5543874FDOQ5543874
Authors: Harry Kesten
Publication date: 1964
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1063/1.1704216
Cites Work
Cited In (37)
- Two limit theorems for the high-dimensional two-stage contact process
- Self-avoiding walk on nonunimodular transitive graphs
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
- Weakly self-avoiding walk on a high-dimensional torus
- Self-avoiding walk, spin systems and renormalization
- New lower bounds on the self-avoiding-walk connective constant
- Spatial mixing and the connective constant: optimal bounds
- Self-avoiding walks and trees in spread-out lattices
- Mean field limit for survival probability of the high-dimensional contact process
- The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions
- Self-avoiding walk is sub-ballistic
- Self-avoiding walk in five or more dimensions. I: The critical behaviour
- The escape transition in a self-avoiding walk model of linear polymers
- Supermultiplicative relations in models of interacting self-avoiding walks and polygons
- The distribution of first hitting times of randomwalks on Erdős-Rényi networks
- Non-equilibrium fluctuations of the weakly asymmetric normalized binary contact path process
- The self-avoiding walk spanning a strip
- Partially directed paths in a wedge
- On covering monotonic paths with simple random walk
- Transforming fixed-length self-avoiding walks into radial \(\text{SLE}_{8/3}\)
- Thoughts on lattice knot statistics
- Self-avoiding walks
- An improved upper bound for the critical value of the contact process on \(\mathbb{Z}^d\) with \(d \geq 3\)
- History and introduction to polygon models and polyominoes
- Monte Carlo Methods for Lattice Polygons
- Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion
- Improved upper bounds on the asymptotic growth velocity of Eden clusters
- Existence of a non-averaging regime for the self-avoiding walk on a high-dimensional infinite percolation cluster
- Entanglement percolation and spheres in \(\mathbb{Z}^d\)
- Critical behaviour of self-avoiding walk in five or more dimensions
- Generalized atmospheric sampling of knotted polygons
- The diffusion of self-avoiding random walk in high dimensions
- The Hammersley-Welsh bound for self-avoiding walk revisited
- Bridge decomposition of restriction measures
- Asymptotic laws for random knot diagrams
- Phase transition for the large-dimensional contact process with random recovery rates on open clusters
- Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
This page was built for publication: On the Number of Self-Avoiding Walks. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5543874)