Random self-avoiding walks on one-dimensional lattices

DOI10.1080/15326349908807144zbMATH Open0702.60063OpenAlexW2042276071MaRDI QIDQ3481029FDOQ3481029

Authors: Sven Erick Alm, Svante Janson 

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

Recommendations

• scientific article; zbMATH DE number 4103108
• Random walks on quasi-one-dimensional lattices
• scientific article; zbMATH DE number 706385
• Self-avoiding walks on the simple cubic lattice
• On self-repellent one-dimensional random walks
• Self-avoiding walks on lattice strips
• Self-avoiding walks in quenched random environments

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) Exact enumeration problems, generating functions (05A15) Sums of independent random variables; random walks (60G50) Paths and cycles (05C38)

Cited In (35)

• Self-avoiding walks and multiple context-free languages
• Self-avoiding walks, the language of science, and Fibonacci numbers
• Self avoiding walk trees and laces
• Title not available (Why is that?)
• Bounds on connective constants of regular graphs
• The drift of a one-dimensional self-avoiding random walk
• Knotting statistics for polygons in lattice tubes
• Self-avoiding walks and trees in spread-out lattices
• Title not available (Why is that?)
• On the probability that self-avoiding walk ends at a given point
• Self-avoiding walks and their languages
• Exactly solved models
• Random walk on a randomly oriented honeycomb lattice
• Counting self-avoiding walks on free products of graphs
• One-dimensional non-nearest-neighbor random walks in the presence of traps
• Anisotropic self-avoiding walks.
• On a function modeling an \(l\)-step self avoiding walk
• On the number of planar Eulerian orientations
• Self-avoiding walk on a three-dimensional Manhattan lattice
• Title not available (Why is that?)
• Title not available (Why is that?)
• First-passage percolation with exponential times on a ladder
• Effect of confinement: polygons in strips, slabs and rectangles
• Title not available (Why is that?)
• Self-avoiding walks on Cayley graphs through the lens of symbolic dynamics
• Directed random walk on the lattices of genus two
• Relations between connected and self-avoiding hikes in labelled complete digraphs
• Weakly directed self-avoiding walks
• Conditional percolation on one-dimensional lattices
• The critical fugacity for surface adsorption of self-avoiding walks on the honeycomb lattice is \(1+\sqrt{2}\)
• Self‐avoiding walk on the hypercube
• The language of self-avoiding walks
• Self-avoiding walks and connective constants
• Self-avoiding walks of specified lengths on rectangular grid graphs
• Exact enumeration of parallel walks on directed lattices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3481029)