Random self-avoiding walks on one-dimensional lattices

DOI10.1080/15326349908807144zbMath0702.60063MaRDI QIDQ3481029

Svante Janson, Sven Erick Alm

Publication date: 1990

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349908807144

zbMATH Keywords

numerical results; asymptotic behaviour; limit theorem; asymptotic behaviour of functionals; walks on lattices; directed self-avoiding walks on undirected graphs

Mathematics Subject Classification ID

60F05: Central limit and other weak theorems

60G50: Sums of independent random variables; random walks

05A15: Exact enumeration problems, generating functions

05C38: Paths and cycles

Related Items

First-Passage Percolation with Exponential Times on a Ladder, Knotting statistics for polygons in lattice tubes, Self-avoiding walks and multiple context-free languages, Self‐avoiding walk on the hypercube, Bounds on connective constants of regular graphs, Weakly directed self-avoiding walks, Counting self-avoiding walks on free products of graphs, Self-avoiding walks, the language of science, and Fibonacci numbers, On the number of planar Eulerian orientations, The critical fugacity for surface adsorption of self-avoiding walks on the honeycomb lattice is \(1+\sqrt{2}\), The language of self-avoiding walks, Self-Avoiding Walks and Connective Constants, Conditional percolation on one-dimensional lattices, Exactly Solved Models, Effect of Confinement: Polygons in Strips, Slabs and Rectangles