Showing 1 - 10 of 19
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...
Persistent link: https://www.econbiz.de/10011424880
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...
Persistent link: https://www.econbiz.de/10015217369
We study the statistics of the optimal path in both random and scale-free networks, where weights are taken from a general distribution P(w). We find that different types of disorder lead to the same universal behavior. Specifically, we find that a single parameter (S defined as AL(-1/v) for...
Persistent link: https://www.econbiz.de/10011424191
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...
Persistent link: https://www.econbiz.de/10011424183
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...
Persistent link: https://www.econbiz.de/10011424184
We study the stability of network communication after removal of a fraction q=1-p of links under the assumption that communication is effective only if the shortest path between nodes i and j after removal is shorter than aℓij(a≥1) where ℓij is the shortest path before removal. For a large...
Persistent link: https://www.econbiz.de/10011424194
We consider the effect of network topology on the optimality of packet routing which is quantified by γc, the rate of packet insertion beyond which congestion and queue growth occurs. We show that for any network, there exists an absolute upper bound, expressed in terms of vertex separators,...
Persistent link: https://www.econbiz.de/10011424193
We numerically simulate the traveling time of a tracer in convective flow between two points (injection and extraction) separated by a distance r in a model of porous media, d=2 percolation. We calculate and analyze the traveling time probability density function for two values of the fraction...
Persistent link: https://www.econbiz.de/10011424185
We study numerically the optimal paths in two and three dimensions on various disordered lattices in the limit of strong disorder. We find that the length l of the optimal path scales with geometric distance r , as l approximately r (d(opt) with d(opt) =1.22+/-0.01 for d=2 and 1.44+/-0.02 for...
Persistent link: https://www.econbiz.de/10011424186
We study the current flow paths between two edges in a random resistor network on a Ltimes L square lattice. Each resistor has resistance e ax, where x is a uniformly-distributed random variable and a controls the broadness of the distribution. We find (a) the scaled variable uequiv L/a nu,...
Persistent link: https://www.econbiz.de/10011424187