Searcharxiv⌕ Search

arXiv subjects

Reuven Cohen

Publications and source records attributed to Reuven Cohen.

63 records · Page 4Linked to original sources
arXiv2005

Stability and topology of scale-free networks under attack and defense strategies

We study tolerance and topology of random scale-free networks under attack and defense strategies that depend on the degree k of the nodes. This situation occurs, for example, when the robustness of a node depends on its degree or in an intentional attack with insufficient knowledge on the network. We determine, for all strategies, the critical fraction p_c of nodes that must be removed for disintegrating the network. We find that for an intentional attack, little knowledge of the well-connected sites is sufficient to strongly reduce p_c. At criticality, the topology of the network depends on the removal strategy, implying that different strategies may lead to different kinds of percolation transitions.

cond-mat.dis-nn↗
arXiv2003

Efficient Immunization Strategies for Computer Networks and Populations

We present an effective immunization strategy for computer networks and populations with broad and, in particular, scale-free degree distributions. The proposed strategy, acquaintance immunization, calls for the immunization of random acquaintances of random nodes (individuals). The strategy requires no knowledge of the node degrees or any other global knowledge, as do targeted immunization strategies. We study analytically the critical threshold for complete immunization. We also study the strategy with respect to the susceptible-infected-removed epidemiological model. We show that the immunization threshold is dramatically reduced with the suggested strategy, for all studied cases.

cond-mat.dis-nn↗
arXiv2003

Optimal Paths in Disordered Complex Networks

We study the optimal distance in networks, $\ell_{\scriptsize opt}$, defined as the length of the path minimizing the total weight, in the presence of disorder. Disorder is introduced by assigning random weights to the links or nodes. For strong disorder, where the maximal weight along the path dominates the sum, we find that $\ell_{\scriptsize opt}\sim N^{1/3}$ in both Erdős-Rényi (ER) and Watts-Strogatz (WS) networks. For scale free (SF) networks, with degree distribution $P(k) \sim k^{-λ}$, we find that $\ell_{\scriptsize opt}$ scales as $N^{(λ- 3)/(λ- 1)}$ for $3<λ<4$ and as $N^{1/3}$ for $λ\geq 4$. Thus, for these networks, the small-world nature is destroyed. For $2 < λ< 3$, our numerical results suggest that $\ell_{\scriptsize opt}$ scales as $\ln^{λ-1}N$. We also find numerically that for weak disorder $\ell_{\scriptsize opt}\sim\ln N$ for both the ER and WS models as well as for SF networks.

cond-mat.soft↗
arXiv2003

Scale-Free Networks are Ultrasmall

We study the diameter, or the mean distance between sites, in a scale-free network, having N sites and degree distribution p(k) ~ k^-a, i.e. the probability of having k links outgoing from a site. In contrast to the diameter of regular random networks or small world networks which is known to be d ~ lnN, we show, using analytical arguments, that scale free networks with 2 3, d ~ lnN. We also show that, for any a>2, one can construct a deterministic scale free network with d ~ lnlnN, and this construction yields the lowest possible diameter.

cond-mat.dis-nn↗
arXiv2003

Geographical Embedding of Scale-Free Networks

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 studied both analytically and through simulations. Our findings indicate dramatic changes in the embedded networks, in comparison to their off-lattice counterparts, and call into question the applicability of off-lattice scale-free models to realistic, everyday-life networks.

cond-mat↗
arXiv2002

Scale-free Networks on Lattices

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 minimization of the total length of the links in the system. We find that all networks with lambda>2 can be successfully embedded up to an (Euclidean) distance xi which can be made as large as desired upon the changing of an external parameter. Clusters of successive chemical shells are found to be compact (the fractal dimension is d_f=d), while the dimension of the shortest path between any two sites is smaller than one: d_min=(lambda-2)/(lambda-1-1/d), contrary to all other known examples of fractals and disordered lattices.

cond-mat.dis-nn↗
arXiv2001

Breakdown of the Internet under intentional attack

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 distribution of P(k)~k^(-a) (where k is the site connectivity), and use percolation theory to study analytically and numerically the critical fraction p_c needed for the disintegration of the network, as well as the size of the largest connected cluster. We find that even networks with a<=3, known to be resilient to random removal of sites, are sensitive to intentional attack. We also argue that, near criticality, the average distance between sites in the spanning (largest) cluster scales with its mass, M, as sqrt(M), rather than as log_k M, as expected for random networks away from criticality. Thus, the disruptive effects of intentional attack become relevant even before the critical threshold is reached.

cond-mat.dis-nn↗
arXiv2000

Resilience of the Internet to random breakdowns

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 the stability of such networks with respect to crashes, such as random removal of sites. Our approach, based on percolation theory, leads to a general condition for the critical fraction of nodes, p_c, that need to be removed before the network disintegrates. We show that for a<=3 the transition never takes place, unless the network is finite. In the special case of the Internet (a=2.5), we find that it is impressively robust, where p_c is approximately 0.99.

cond-mat.dis-nn↗