Related papers: Possible Connection between the Optimal Path and F…
We study the distribution of optimal path lengths in random graphs with random weights associated with each link (``disorder''). With each link $i$ we associate a weight $\tau_i = \exp(ar_i)$ where $r_i$ is a random number taken from a…
We review results on the scaling of the optimal path length in random networks with weighted links or nodes. In strong disorder we find that the length of the optimal path increases dramatically compared to the known small world result for…
We study the current flow paths between two edges in a random resistor network on a $L\times L$ square lattice. Each resistor has resistance $e^{ax}$, where $x$ is a uniformly-distributed random variable and $a$ controls the broadness of…
We study the statistics of the optimal path in both random and scale free networks, where weights $w$ are taken from a general distribution $P(w)$. We find that different types of disorder lead to the same universal behavior. Specifically,…
We study the flow of fluid in porous media in dimensions $d=2$ and 3. The medium is modeled by bond percolation on a lattice of $L^d$ sites, while the flow front is modeled by tracer particles driven by a pressure difference between two…
How local cracks can contribute to the global cracks landscape is a goal of several scientific topics, for example, how bottlenecks can impact the robustness of traffic into a city? In one direction, cracks from cascading failures into…
Using Monte-Carlo simulations, we determine the scaling form for the probability distribution of the shortest path, $\ell$, between two lines in a 3-dimensional percolation system at criticality; the two lines can have arbitrary positions,…
In recent decades, much attention has been focused on the topic of optimal paths in weighted networks due to its broad scientific interest and technological applications. In this work we revisit the problem of the optimal path between two…
We present a scaling hypothesis for the distribution function of the shortest paths connecting any two points on a percolating cluster which accounts for {\it (i)} the effect of the finite size of the system, and {\it (ii)} the dependence…
We analyze the statistics of the shortest and fastest paths on the road network between randomly sampled end points. To a good approximation, these optimal paths are found to be directed in that their lengths (at large scales) are linearly…
By a new type of finite size scaling analysis on the square lattice, and by renormalization group calculations on hierarchical lattices we investigate the effects of dilution on optimal undirected self-avoiding paths in a random…
In this work we are concerned with the crossover between strong disorder (SD) and weak disorder (WD) behaviors in three well-known problems that involve minimal paths: directed polymers (directed paths with fixed starting point and length),…
We introduce a scalable searching algorithm for finding nodes and contents in random networks with Power-Law (PL) and heavy-tailed degree distributions. The network is searched using a probabilistic broadcast algorithm, where a query…
We show that choosing appropriate distributions of the randomness, the search for optimal paths links diverse problems of disordered media like directed percolation, invasion percolation, directed and non-directed spanning polymers. We also…
We consider the percolation problem of sites on an $L\times L$ square lattice with periodic boundary conditions which were unvisited by a random walk of $N=uL^2$ steps, i.e. are vacant. Most of the results are obtained from numerical…
We study the distributions of traveling length l and minimal traveling time t through two-dimensional percolation porous media characterized by long-range spatial correlations. We model the dynamics of fluid displacement by the convective…
We study the optimal distance in networks, $\ell_{\scriptsize opt}$, defined as the length of the path minimizing the total weight, in the presence of disorder. Disorder is introduced by assigning random weights to the links or nodes. For…
We consider the mean distribution functions Phi(r|l), Phi(B)(r|l), and Phi(S)(r|l), giving the probability that two sites on the incipient percolation cluster, on its backbone and on its skeleton, respectively, connected by a shortest path…
The probability distributions of the masses of the clusters spanning from top to bottom of a percolating lattice at the percolation threshold are obtained in all dimensions from two to five. The first two cumulants and the exponents for the…
Numerous problems of both theoretical and practical interest are related to finding shortest (or otherwise optimal) paths in networks, frequently in the presence of some obstacles or constraints. A somewhat related class of problems focuses…