An efficient transfer matrix technique is introduced to study directed optimal paths in two and three dimensions. The roughness exponent zeta is 0.6325 +/- 0.0007 for the two-dimensional case and zeta = 0.555 +/- 0.008 for the three-dimensional one, in agreement with the recent conjecture zeta = v(perpendicular to)/v(parallel to), where v(perpendicular to) and v(parallel to) are the correlation length exponents of directed percolation. Exactly solvable examples are also analyzed
We consider the optimal paths in a d-dimensional lattice, where the bonds have isotropically correl...
In the mean field (or random link) model there are n points and inter-point distances are independen...
Abstract. It is shown that the critical exponent g1 related to pair-connectiveness and shortest-path...
An efficient transfer matrix technique is introduced to study directed optimal paths in two and thre...
We study the behavior of the optimal path between two sites separated by a distance r on a d-dimensi...
A numerical study of optimal paths in the directed polymer model shows that the paths are similar t...
The stability of directed Min-Max optimal paths in cases of change in the random media is studied. ...
19 pagesRephrasing the backbone of two-dimensional percolation as a monochromatic path crossing prob...
Some characteristics of the shortest paths connecting distant points on a percolation network are st...
The separation of two points on a percolation network is characterised not only by the distance betw...
We study numerically the optimal paths in two and three dimensions on various disordered lattices in...
International audienceA useful result about leftmost and rightmost paths in two dimensional bond per...
We investigate the hierarchy of optimal paths in a disordered landscape, based on the best path, the...
We present a renormalization group calculation for the directed percolation problem in an anisotropi...
A percolation probability for directed, compact percolation near a damp wall, which interpolates bet...
We consider the optimal paths in a d-dimensional lattice, where the bonds have isotropically correl...
In the mean field (or random link) model there are n points and inter-point distances are independen...
Abstract. It is shown that the critical exponent g1 related to pair-connectiveness and shortest-path...
An efficient transfer matrix technique is introduced to study directed optimal paths in two and thre...
We study the behavior of the optimal path between two sites separated by a distance r on a d-dimensi...
A numerical study of optimal paths in the directed polymer model shows that the paths are similar t...
The stability of directed Min-Max optimal paths in cases of change in the random media is studied. ...
19 pagesRephrasing the backbone of two-dimensional percolation as a monochromatic path crossing prob...
Some characteristics of the shortest paths connecting distant points on a percolation network are st...
The separation of two points on a percolation network is characterised not only by the distance betw...
We study numerically the optimal paths in two and three dimensions on various disordered lattices in...
International audienceA useful result about leftmost and rightmost paths in two dimensional bond per...
We investigate the hierarchy of optimal paths in a disordered landscape, based on the best path, the...
We present a renormalization group calculation for the directed percolation problem in an anisotropi...
A percolation probability for directed, compact percolation near a damp wall, which interpolates bet...
We consider the optimal paths in a d-dimensional lattice, where the bonds have isotropically correl...
In the mean field (or random link) model there are n points and inter-point distances are independen...
Abstract. It is shown that the critical exponent g1 related to pair-connectiveness and shortest-path...