Random self-avoiding walks on one-dimensional lattices
From MaRDI portal
Publication:3481029
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
Cited in
(35)- Self-avoiding walks, the language of science, and Fibonacci numbers
- Self avoiding walk trees and laces
- Self-avoiding walks and multiple context-free languages
- scientific article; zbMATH DE number 3954959 (Why is no real title available?)
- 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
- On the probability that self-avoiding walk ends at a given point
- scientific article; zbMATH DE number 4103108 (Why is no real title available?)
- 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 the number of planar Eulerian orientations
- On a function modeling an \(l\)-step self avoiding walk
- Self-avoiding walk on a three-dimensional Manhattan lattice
- scientific article; zbMATH DE number 1047458 (Why is no real title available?)
- scientific article; zbMATH DE number 4070938 (Why is no real title available?)
- Effect of confinement: polygons in strips, slabs and rectangles
- First-passage percolation with exponential times on a ladder
- scientific article; zbMATH DE number 6806804 (Why is no real title available?)
- Self-avoiding walks on Cayley graphs through the lens of symbolic dynamics
- Relations between connected and self-avoiding hikes in labelled complete digraphs
- Directed random walk on the lattices of genus two
- 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)