Related papers: How to make a fragile network robust and vice vers…
We study cascading failures in a system comprising interdependent networks/systems, in which nodes rely on other nodes both in the same system and in other systems to perform their function. The (inter-)dependence among nodes is modeled…
In many cases of attacks or failures, memory effects play a significant role. Therefore, we present a model that not only considers the dependencies between nodes but also incorporates the memory effects of attacks. Our research…
Networks are known to be prone to link failures. In this paper we set out to investigate how networks of varying connectivity patterns respond to different link failure schemes in terms of connectivity, clustering coefficient and shortest…
Using a steady state process of node duplication and deletion we produce networks with 1/k scale-free degree distributions in the limit of vanishing connectance. This occurs even though there is no growth involved and inherent preferential…
This paper presents a complex systems overview of a power grid network. In recent years, concerns about the robustness of the power grid have grown because of several cascading outages in different parts of the world. In this paper,…
We analyze the degree distribution's cut-off in finite size scale-free networks. We show that the cut-off behavior with the number of vertices $N$ is ruled by the topological constraints induced by the connectivity structure of the network.…
Network reliability is a well-studied problem that requires to measure the probability that a target node is reachable from a source node in a probabilistic (or uncertain) graph, i.e., a graph where every edge is assigned a probability of…
We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant…
In this paper, we study crucial elements of a complex network, namely its nodes and connections, which play a key role in maintaining the network's structure and function under unexpected structural perturbations of nodes and edges removal.…
Interconnected networks have been shown to be much more vulnerable to random and targeted failures than isolated ones, raising several interesting questions regarding the identification and mitigation of their risk. The paradigm to address…
k-connectivity is an important measure of network robustness and resilience to random faults and disruptions. We undertake both local and global approaches to k-connectivity and calculate closed form analytic formulas for the probability…
Research on the vulnerability of electric networks with a complex network approach has produced significant results in the last decade, especially for transmission networks. These studies have shown that there are causal relations between…
We study the robustness of complex networks subject to edge removal. Several network models and removing strategies are simulated. Rather than the existence of the giant component, we use total connectedness as the criterion of breakdown.…
The behavior of complex networks under failure or attack depends strongly on the specific scenario. Of special interest are scale-free networks, which are usually seen as robust under random failure but appear to be especially vulnerable to…
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent…
We describe a procedure that allows continuously tuning the average degree $\langle k \rangle$ of uncorrelated networks with power-law degree distribution $p(k)$. Inn order to do this, we modify the low-$k$ region of $p(k)$, while…
We derive the finite size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent $2<\gamma<3$. Degree heterogeneity increases the presence of triangles in…
We study cascading failures in networks using a dynamical flow model based on simple conservation and distribution laws to investigate the impact of transient dynamics caused by the rebalancing of loads after an initial network failure…
Given a graph $G$ whose edges are perfectly reliable and whose nodes each operate independently with probability $p\in[0,1],$ the node reliability of $G$ is the probability that at least one node is operational and that the operational…
In practice, since many communication networks are huge in scale, or complicated in structure, or even dynamic, the predesigned linear network codes based on the network topology is impossible even if the topological structure is known.…