Self-avoiding random walks: Some exactly soluble cases
From MaRDI portal
Publication:4144549
DOI10.1063/1.523515zbMATH Open0368.60078OpenAlexW2038302299MaRDI QIDQ4144549FDOQ4144549
Authors: Deepak Dhar
Publication date: 1978
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1063/1.523515
Cited In (17)
- Unequal edge inclusion probabilities in link-tracing network sampling with implications for respondent-driven sampling
- Adsorption of a flexible self-avoiding polymer chain: Exact results on fractal lattices
- Quenched averages for self-avoiding walks and polygons on deterministic fractals
- Different self-avoiding walks on percolation clusters: A small-cell real-space renormalization-group study
- The fixed point of a generalization of the renormalization group maps for self-avoiding paths on gaskets
- Self-avoiding walks on random fractal environments.
- Dimer coverings on the Sierpinski gasket
- Lattice dynamics, random walks, and nonintegral effective dimensionality
- Lattice animals on a class of hierarchical graphs
- Pulling self-interacting linear polymers on a family of fractal lattices embedded in three-dimensional space
- Polymer collapse transition: a view from the complex fugacity plane
- Semiflexible crossing-avoiding trails on plane-filling fractals
- Interpenetration of two chains different in sizes: some exact results
- Acyclic orientations on the Sierpinski gasket
- The exponent for the mean square displacement of self-avoiding random walk on the Sierpinski gasket
- Semi-flexible compact polymers in two dimensional nonhomogeneous confinement
- Self-avoiding paths on the three dimensional Sierpinski gasket
This page was built for publication: Self-avoiding random walks: Some exactly soluble cases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4144549)