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,...

To study transport properties of complex networks, we analyze the equivalent conductance G between two arbitrarily chosen nodes of random scale-free networks with degree distribution P(k)sim k -lambda in which each link has the same unit resistance. We predict a broad range of values of G, with...

We study the behavior of the optimal path between two sites separated by a distance r on a d-dimensional lattice of linear size L with weight assigned to each site. We focus on the strong disorder limit, i.e., when the weight of a single site dominates the sum of the weights along each path. We...

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...

We study transport properties such as electrical and frictionless flow conductance on scale-free and Erdős–Rényi networks. We consider the conductance G between two arbitrarily chosen nodes where each link has the same unit resistance. Our theoretical analysis for scale-free networks...

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...

We study the transport properties of model networks such as scale-free and Erdös-Rényi networks as well as a real network. We consider few possibilities for the transport problem. We start by studying the conductance G between two arbitrarily chosen nodes where each link has the same unit...

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...

This paper considers the issues around managing large scientific projects, and draws conclusions for the governance and management of FuturICT, based on previous experience of Big Science projects, such as CERN and ATLAS. We also consider the legal and ethical issues of the FuturICT project as...

We generate optimal paths between two given sites on a lattice representing a disordered energy landscape by applying the Dijkstra algorithm. We study the geometrical and energetic scaling properties of the optimal path under two different energy distributions that yield the weak and strong...