Deterministic and random partially self-avoiding walks in random media

César Augusto Sangaletti Terçariol, Rodrigo Silva González, Wilnice Tavares Reis Oliveira and Alexandre Souto Martinez

Physica A: Statistical Mechanics and its Applications, 2007, vol. 386, issue 2, 678-680

Abstract: Consider a set of N cities randomly distributed in the bulk of a hypercube with d dimensions. A walker, with memory μ, begins his route from a given city of this map and moves, at each discrete time step, to the nearest point, which has not been visited in the preceding μ steps. After reviewing the more interesting general results, we consider one-dimensional disordered media and show that the walker needs not to have full memory of its trajectory to explore the whole system, it suffices to have memory of order lnN/ln2.

Keywords: Deterministic walks; Disordered media; Partially self-avoiding walks (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437107007790
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:386:y:2007:i:2:p:678-680

DOI: 10.1016/j.physa.2007.07.019

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 ().