We review the analysis of the length of the optimal path ℓopt in random networks with disorder (i.e., random weights on the links). In the case of strong disorder, in which the maximal weight along the path dominates the sum, we find that ℓopt increases dramatically compared to the known...

We study the transition between the strong and weak disorder regimes in the scaling properties of the average optimal path ℓopt in a disordered Erdős–Rényi (ER) random network and scale-free (SF) network. Each link i is associated with a weight τi≡exp(ari), where ri is a random number...

We study the statistical properties of a recently proposed social networks measure of fragmentation F after removal of a fraction q of nodes or links from the network. The measure F is defined as the ratio of the number of pairs of nodes that are not connected in the fragmented network to the...

We perform Monte Carlo simulations to determine the average excluded area 〈Aex〉 of randomly oriented squares, randomly oriented widthless sticks and aligned squares in two dimensions. We find significant differences between our results for randomly oriented squares and previous analytical...

We study the betweenness centrality of fractal and non-fractal scale-free network models as well as real networks. We show that the correlation between degree and betweenness centrality C of nodes is much weaker in fractal network models compared to non-fractal models. We also show that nodes of...

We consider the cluster mass distribution between two lines of arbitrary orientations and lengths in porous media in three dimensions, and model the porous media by bond percolation at the percolation threshold pc. We observe that for many geometrical configurations the mass probability...

We determine the backbone mass distributions for bond percolation between two lines of arbitrary orientations in three dimensions. All simulations were performed at the percolation threshold pc. The slope of the power law regime of the backbone mass distribution is dependent upon the angle...

We review results on the scaling of the optimal path length l(opt) in random networks with weighted links or nodes. We refer to such networks as "weighted" or "disordered" networks. The optimal path is the path with minimum sum of the weights. In strong disorder, where the maximal weight along...

In this paper, we apply scaling laws from percolation theory to the problem of estimating the time for a fluid injected into an oilfield to breakthrough into a production well. The main contribution is to show that when these previously published results are used on realistic data they are in...

In this paper, we apply scaling laws from percolation theory to the problem of estimating the time for a fluid injected into an oil field to breakthrough into a production well. The main contribution is to show that when these previously published results are used on realistic data they are in...