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

Mirosław R. Dudek

Physica A: Statistical Mechanics and its Applications, 1995, vol. 219, issue 1, 114-120

Abstract: 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.

Date: 1995
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378437195001665
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:219:y:1995:i:1:p:114-120

DOI: 10.1016/0378-4371(95)00166-5

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().