Related papers: How to make a fragile network robust and vice vers…
We offer an example of an network model with a power law degree distribution, P(k) ~ k^{-alpha}, for nodes but which nevertheless has a well-defined geography and a nonzero threshold percolation probability for alpha>2, the range of…
In contrast to the conventional wisdom that scale-free networks are prone to epidemic propagation, in the paper we present that disease spreading is inhibited in fractal scale-free networks. We first propose a novel network model and show…
We study a problem of failure of two interdependent networks in the case of correlated degrees of mutually dependent nodes. We assume that both networks (A and B) have the same number of nodes $N$ connected by the bidirectional dependency…
We consider the problem of diffusing information in networks that contain malicious nodes. We assume that each normal node in the network has no knowledge of the network topology other than an upper bound on the number of malicious nodes in…
A network is formed using the $N$ sites of an one-dimensional lattice in the shape of a ring as nodes and each node with the initial degree $k_{in}=2$. $N$ links are then introduced to this network, each link starts from a distinct node,…
In this paper, we study the robustness of network topologies. We use the concept of percolation as measuring tool to assess the reliability polynomial of those systems which can be modeled as a general inhomogeneous random graph as well as…
This paper is concerned with the characterization of the relationship between topology and traffic dynamics. We use a model of network generation that allows the transition from random to scale free networks. Specifically, we consider three…
Dependency links in single-layer networks offer a convenient way of modeling nonlocal percolation effects in networked systems where certain pairs of nodes are only able to function together. We study the percolation properties of the weak…
We study the structural constraint of random scale-free networks that determines possible combinations of the degree exponent $\gamma$ and the upper cutoff $k_c$ in the thermodynamic limit. We employ the framework of graphicality…
We study the problem of wireless network resilience to node failures from a percolation-based perspective. In practical wireless networks, it is often the case that the failure probability of a node depends on its degree (number of…
In this work, we propose an interdependent, multilayer network model and percolation process that matches infrastructures better than previous models by allowing some nodes to survive when their interdependent neighbors fail. We consider a…
Scale-free networks are characterized by a degree distribution with power-law behavior and have been shown to arise in many areas, ranging from the World Wide Web to transportation or social networks. Degree distributions of observed…
In this article, we propose a growing network model based on an optimal policy involving both topological and geographical measures. In this model, at each time step, a new node, having randomly assigned coordinates in a $1 \times 1$…
This paper presents an analytical framework to model fault-tolerance in unstructured peer-to-peer overlays, represented as complex networks. We define a distributed protocol peers execute for managing the overlay and reacting to node…
Many real-world networks exhibit scale-free feature, have a small diameter and a high clustering tendency. We have studied the properties of a growing network, which has all these features, in which an incoming node is connected to its…
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…
Networks composed from both connectivity and dependency links were found to be more vulnerable compared to classical networks with only connectivity links. Their percolation transition is usually of a first order compared to the second…
Generally, networks are classified into two sides of inequality and equality with respect to the number of links at nodes by the types of degree distributions. One side includes many social, technological, and biological networks which…
Link failures in supply networks can have catastrophic consequences that can lead to a complete collapse of the network. Strategies to prevent failure spreading are thus heavily sought after. Here, we make use of a spanning tree formulation…
We propose and study a model of scale-free growing networks that gives a degree distribution dominated by a power-law behavior with a model-dependent, hence tunable, exponent. The model represents a hybrid of the growing networks based on…