Abstract
We study numerically the optimal paths in two and three dimensions on various disordered lattices in the limit of strong disorder. We find that the length [Formula presented] of the optimal path scales with geometric distance [Formula presented], as [Formula presented] with [Formula presented] for [Formula presented] and [Formula presented] for [Formula presented], independent of whether the optimization is on a path of weighted bonds or sites, and independent of the lattice or its coordination number. Our finding suggests that the exponent [Formula presented] is universal, depending only on the dimension of the system.
| Original language | English |
|---|---|
| Pages (from-to) | 4 |
| Number of pages | 1 |
| Journal | Physical Review E |
| Volume | 70 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2004 |
Bibliographical note
Funding Information:We wish to thank P. Grassberger for discussions and the Israel Science Foundation and the Office of Naval Research for support.