Diffusion on self-avoiding walk networks
- 7 September 1989
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 22 (17) , 3621-3627
- https://doi.org/10.1088/0305-4470/22/17/026
Abstract
Two properties of self-avoiding walk networks, constructed by connecting the nearest-neighbour points of self-avoiding walks on the square lattice, are studied numerically. The average end-to-end linear part of such networks is investigated, and is found to be proportional to the length of the walk. Secondly, random walks on this structure are studied and the associated spectral dimension of such networks is estimated to be 1.03+or-0.03, which implies that the effect of such connections affects the spectral dimension only weakly, if at all.Keywords
This publication has 23 references indexed in Scilit:
- The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walkJournal of Statistical Physics, 1988
- A new algorithm to extract the backbone in a random resistor networkJournal of Physics A: General Physics, 1987
- A Levy flight approach to diffusion on a SAW with cross-linksJournal of Physics A: General Physics, 1987
- Random walks with intersections: Static and dynamic fractal propertiesPhysical Review A, 1987
- On the critical behaviour of self-avoiding walksJournal of Physics A: General Physics, 1987
- Resistance and spectral dimension of self-avoiding walks with local bridgesPhysical Review A, 1987
- Diffusion on two-dimensional random walksPhysical Review Letters, 1987
- Diffusion in disordered mediaAdvances in Physics, 1987
- Random walk on self-avoiding walk: a model for conductivity of linear polymersJournal of Physics A: General Physics, 1985
- Ising model on self-avoiding walk chainsZeitschrift für Physik B Condensed Matter, 1984