Optimal Path in Two and Three Dimensions

Abstract

We apply the Dijkstra algorithm to generate optimal paths between two given sites on a lattice representing a disordered energy landscape. We study the geometrical and energetic scaling properties of the optimal path where the energies are taken from a uniform distribution. Our numerical results for both two and three dimensions suggest that the optimal path for random uniformly distributed energies is in the same universality class as the directed polymers. We present physical realizations of polymers in disordered energy landscape for which this result is relevant.

7 pages, 4 figures

References in corpus (1)

• Quasi-static cracks and minimal energy surfaces

Cited by in corpus (16)

• Fracturing the optimal paths
• Optimal path cracks in correlated and uncorrelated lattices
• Phase Diagram of Optimal Paths
• Optimization and plasticity in disordered media
• Tomographic-like reconstruction of the percolation cluster as a phase transition
• Scaling behavior of domain walls at the T=0 ferromagnet to spin-glass transition
• The upper critical dimension of the negative-weight percolation problem
• Typical and large-deviation properties of minimum-energy paths on disordered hierarchical lattices
• Phase transitions in diluted negative-weight percolation models
• Is negative-weight percolation compatible with SLE?
• Mean-field behavior of the negative-weight percolation model on random regular graphs
• Entanglement transition of elastic lines in a strongly disordered environment
• Configurational statistics of densely and fully packed loops in the negative-weight percolation model
• Loop erased random walk on percolation cluster: Crossover from Euclidean to fractal geometry
• Statistical thermodynamics for choice models on graphs
• Equation of state for agents on graphs