We study network configurations that provide optimal robustness to random breakdowns for networks with a given number of nodes N and a given cost—which we take as the average number of connections per node 〈k〉. We find that the network design that maximizes fc, the fraction of nodes that...

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 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 study the optimal distance ℓopt in random networks in the presence of disorder implemented by assigning random weights to the links. The optimal distance between two nodes is the length of the path for which the sum of weights along the path (“cost”) is a minimum. We study the case of...

A method for embedding graphs in Euclidean space is suggested. The method connects nodes to their geographically closest neighbors and economizes on the total physical length of links. The topological and geometrical properties of scale-free networks embedded by the suggested algorithm are...

We study the tolerance of a scale-free network (having a connectivity distribution P(k)∼k−γ) under systematic variation of the attack strategy. In an attack, the probability that a given node is destroyed, depends on the number of its links k via W(k)∼kα, where α varies from −∞...

We use the generating function formalism to calculate the fractal dimensions for the percolating cluster at criticality in Erdős–Rényi (ER) and random scale free (SF) networks, with degree distribution P(k)=ck−λ. We show that the chemical dimension is dl=2 for ER and SF networks with...

We record and analyze the noise experienced by a tracer particle in a one-dimensional system of particles interacting with hard-core interactions. We find that the correlations of the noise are long-range, with an algebraic decay in time.

We generalize the conventional model of two-dimensional site percolation by including both (1) continuous deposition of particles on a two-dimensional substrate, and (2) diffusion of these particles in two-dimensions. This new model is motivated by recent thin film deposition experiments using...