2.4k citations · 7.3k across the 76 of their papers we have counts for
15 papers · 1 filter
Analytical results for the distribution of shortest path lengths in random networks
Eytan Katzav, Mor Nitzan, Daniel ben-Avraham +4
We present two complementary analytical approaches for calculating the distribution of shortest path lengths in Erdos-Rényi networks, based on recursion equations for the shells ar…
Random walk with priorities in communication-like networks
Nikolaos Bastas, Michalis Maragakis, Panos Argyrakis +3
We study a model for a random walk of two classes of particles (A and B). Where both species are present in the same site, the motion of A's takes precedence over that of B's. The…
Retention capacity of random surfaces
Craig L. Knecht, Walter Trump, Daniel ben-Avraham +1
We introduce a "water retention" model for liquids captured on a random surface with open boundaries, and investigate it for both continuous and discrete surface heights 0, 1, ...…
Partition of Networks into Basins of Attraction
Shai Carmi, P. L. Krapivsky, Daniel ben-Avraham
We study partition of networks into basins of attraction based on a steepest ascent search for the node of highest degree. Each node is associated with, or "attracted" to its neigh…
Kleinberg navigation on anisotropic lattices
J. Mauricio Campuzano, James P. Bagrow, Daniel ben-Avraham
We study the Kleinberg problem of navigation in Small World networks when the underlying lattice is stretched along a preferred direction. Extensive simulations confirm that maxima…
Sequence Nets
Jie Sun, Takashi Nishikawa, Daniel ben-Avraham
We study a new class of networks, generated by sequences of letters taken from a finite alphabet consisting of letters (corresponding to types of nodes) and a fixed set of…
Portraits of Complex Networks
J. P. Bagrow, E. M. Bollt, J. D. Skufca +1
We propose a method for characterizing large complex networks by introducing a new matrix structure, unique for a given network, which encodes structural information; provides usef…
What is Special about Diffusion on Scale-Free Nets?
Erik M. Bollt, Daniel ben-Avraham
We study diffusion (random walks) on recursive scale-free graphs, and contrast the results to similar studies in other analytically soluble media. This allows us to identify ways i…
Designer Nets from Local Strategies
Hernan Rozenfeld, Daniel ben-Avraham
We propose a local strategy for constructing scale-free networks of arbitrary degree distributions, based on the redirection method of Krapivsky and Redner [Phys. Rev. E 63, 066123…
Efficient Immunization Strategies for Computer Networks and Populations
Reuven Cohen, Shlomo Havlin, Daniel ben-Avraham
We present an effective immunization strategy for computer networks and populations with broad and, in particular, scale-free degree distributions. The proposed strategy, acquainta…
Scale-free Networks on Lattices
Alejandro F. Rozenfeld, Reuven Cohen, Daniel ben-Avraham +1
We suggest a method for embedding scale-free networks, with degree distribution P(k) k^-lambda, in regular Euclidean lattices. The embedding is driven by a natural constraint of mi…
Percolation in Directed Scale-Free Networks
N. Schwartz, R. Cohen, D. ben-Avraham +2
Many complex networks in nature have directed links, a property that affects the network's navigability and large-scale topology. Here we study the percolation properties of such d…
Percolation Critical Exponents in Scale-Free Networks
Reuven Cohen, Daniel ben-Avraham, Shlomo Havlin
We study the behavior of scale-free networks, having connectivity distribution P(k) k^-a, close to the percolation threshold. We show that for networks with 3<a<4, known to undergo…
Breakdown of the Internet under intentional attack
Reuven Cohen, Keren Erez, Daniel ben-Avraham +1
We study the tolerance of random networks to intentional attack, whereby a fraction p of the most connected sites is removed. We focus on scale-free networks, having connectivity d…
Resilience of the Internet to random breakdowns
Reuven Cohen, Keren Erez, Daniel ben-Avraham +1
A common property of many large networks, including the Internet, is that the connectivity of the various nodes follows a scale-free power-law distribution, P(k)=ck^-a. We study th…