Optimal path in weak and strong disorder

Nehemia Schwartz, Markus Porto, Shlomo Havlin, Armin Bunde

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations

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

Original languageEnglish
Pages (from-to)317-321
Number of pages5
JournalPhysica A: Statistical Mechanics and its Applications
Volume266
Issue number1-4
DOIs
StatePublished - 15 Apr 1999
EventProceedings of the 1998 International Conference on Percolation and Disordered Systems: Theory and Applications - Giessen, Ger
Duration: 14 Jul 199817 Jul 1998

Fingerprint

Dive into the research topics of 'Optimal path in weak and strong disorder'. Together they form a unique fingerprint.

Cite this