On the Number of Self-Avoiding Walks. II

From MaRDI portal
Revision as of 03:27, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5543874

DOI10.1063/1.1704216zbMath0161.37402OpenAlexW2268017341MaRDI QIDQ5543874

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




Related Items (37)

Spatial mixing and the connective constant: optimal boundsGENERALIZED ATMOSPHERIC SAMPLING OF KNOTTED POLYGONSThe diffusion of self-avoiding random walk in high dimensionsSelf-avoiding walks and trees in spread-out latticesMean field limit for survival probability of the high-dimensional contact processSelf-avoiding walk is sub-ballisticImproved upper bounds on the asymptotic growth velocity of Eden clustersPartially directed paths in a wedgeWeakly self-avoiding walk on a high-dimensional torusThe escape transition in a self-avoiding walk model of linear polymersThe Self-Avoiding-Walk and Percolation Critical Points in High DimensionsThe self-avoiding walk spanning a stripThe distribution of first hitting times of randomwalks on Erdős–Rényi networksThe pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.Transforming fixed-length self-avoiding walks into radial \(\text{SLE}_{8/3}\)An improved upper bound for the critical value of the contact process on \(\mathbb{Z}^d\) with \(d \geq 3\)The Hammersley-Welsh bound for self-avoiding walk revisitedExistence of a non-averaging regime for the self-avoiding walk on a high-dimensional infinite percolation clusterSelf-avoiding walk in five or more dimensions. I: The critical behaviourPhase transition for the large-dimensional contact process with random recovery rates on open clustersNon-equilibrium fluctuations of the weakly asymmetric normalized binary contact path processNew lower bounds on the self-avoiding-walk connective constantCritical behaviour of self-avoiding walk in five or more dimensionsSelf-avoiding walk on nonunimodular transitive graphsBridge decomposition of restriction measuresTwo limit theorems for the high-dimensional two-stage contact processOn covering monotonic paths with simple random walkThoughts on lattice knot statisticsHistory and Introduction to Polygon Models and PolyominoesMonte Carlo Methods for Lattice PolygonsSelf-avoiding walk, spin systems and renormalizationBounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertionEntanglement percolation and spheres in \(\mathbb{Z}^d\)Asymptotic laws for random knot diagramsSupermultiplicative relations in models of interacting self-avoiding walks and polygonsSelf-avoiding walks




Cites Work




This page was built for publication: On the Number of Self-Avoiding Walks. II