Optimal path in weak and strong disorder

Nehemia Schwartz, Markus Porto, Shlomo Havlin and Armin Bunde

Physica A: Statistical Mechanics and its Applications, 1999, vol. 266, issue 1, 317-321

Abstract: We generate optimal paths between two given sites on a lattice representing a disordered energy landscape by applying the Dijkstra algorithm. We study the geometrical and energetic scaling properties of the optimal path under two different energy distributions that yield the weak and strong disorder limits. Our numerical results, for both two and three dimensions, suggest that the optimal paths in weak disorder are in the same universality class as the directed polymers and in the strong disorder limit are fractals with exponents similar to that found by Cieplak et al. (Phys. Rev. Lett. 72 (1994) 2320; 76 (1996) 3754).

Keywords: Optimal path; Dijkstra algorithm; Directed polymer (search for similar items in EconPapers)
Date: 1999
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437198006098
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:266:y:1999:i:1:p:317-321

DOI: 10.1016/S0378-4371(98)00609-8

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