Random self-avoiding walks on one-dimensional lattices

DOI10.1080/15326349908807144zbMath0702.60063OpenAlexW2042276071MaRDI 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 resultsasymptotic behaviourlimit theoremasymptotic behaviour of functionalswalks on latticesdirected self-avoiding walks on undirected graphs

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Sums of independent random variables; random walks (60G50) Exact enumeration problems, generating functions (05A15) Paths and cycles (05C38)

Related Items (15)

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

This page was built for publication: Random self-avoiding walks on one-dimensional lattices