Finite-size scaling behavior of biased SAW at the percolation threshold

An algorithm determining the most likely trajectories on a percolation cluster of a random walker subject to a constant field has been constructed. The resulting trajectories are represented by self-avoiding walks for which the average time spent at a percolation incipient cluster obeys finite-size...

Full description

Saved in:
Bibliographic Details
Published inPhysica A Vol. 219; no. 1; pp. 114 - 120
Main Author Dudek, Mirosław R.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 15.09.1995
Online AccessGet full text

Cover

More Information
Summary:An algorithm determining the most likely trajectories on a percolation cluster of a random walker subject to a constant field has been constructed. The resulting trajectories are represented by self-avoiding walks for which the average time spent at a percolation incipient cluster obeys finite-size scaling behavior.
ISSN:0378-4371
1873-2119
DOI:10.1016/0378-4371(95)00166-5