Phase diagram of optimal paths

We show that by choosing appropriate distributions of the randomness the search for optimal paths links diverse problems of disordered media, such as directed percolation, invasion percolation, and directed and nondirected spanning polymers. We also introduce a simple and efficient algorithm, which solves the d-dimensional model numerically in O(N(1+df/d)) steps, where df is the fractal dimension of the path. Using extensive simulations in two dimensions, we identify the phase boundaries of the directed polymer universality class. A new strong-disorder phase occurs where the optimum paths are self-affine with parameter-dependent scaling exponents. Furthermore, the phase diagram contains directed and nondirected percolation as well as the directed random walk models at specific points and lines.