Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userVulnerability of state-interdependent networks under malware spreading
166
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Computer viruses are evolving by developing spreading mechanisms based on the use of multiple vectors of propagation. The use of the social network as an extra vector of attack to penetrate the security measures in IP networks is improving the effectiveness of malware, and have therefore been used by the most aggressive viruses, like Conficker and Stuxnet. In this work we use interdependent networks to model the propagation of these kind of viruses. In particular, we study the propagation of a SIS model on interdependent networks where the state of each node is layer-independent and the dynamics in each network follows either a contact process or a reactive process, with different propagation rates. We apply this study to the case of existing multilayer networks, namely a Spanish scientific community of Statistical Physics, formed by a social network of scientific collaborations and a physical network of connected computers in each institution. We show that the interplay between layers increases dramatically the infectivity of viruses in the long term and their robustness against immunization.
rate research
Read More
Modern world builds on the resilience of interdependent infrastructures characterized as complex networks. Recently, a framework for analysis of interdependent networks has been developed to explain the mechanism of resilience in interdependent networks. Here we extend this interdependent network model by considering flows in the networks and study the systems resilience under different attack strategies. In our model, nodes may fail due to either overload or loss of interdependency. Under the interaction between these two failure mechanisms, it is shown that interdependent scale-free networks show extreme vulnerability. The resilience of interdependent SF networks is found in our simulation much smaller than single SF network or interdependent SF networks without flows.
Recent empirical research has shown that links between groups reinforce individuals within groups to adopt cooperative behaviour. Moreover, links between networks may induce cascading failures, competitive percolation, or contribute to efficient transportation. Here we show that there in fact exists an intermediate fraction of links between groups that is optimal for the evolution of cooperation in the prisoners dilemma game. We consider individual groups with regular, random, and scale-free topology, and study their different combinations to reveal that an intermediate interdependence optimally facilitates the spreading of cooperative behaviour between groups. Excessive between-group links simply unify the two groups and make them act as one, while too rare between-group links preclude a useful information flow between the two groups. Interestingly, we find that between-group links are more likely to connect two cooperators than in-group links, thus supporting the conclusion that they are of paramount importance.
Many dynamical phenomena, e.g., pathogen transmission, disruptions in transport over networks, and (fake) news purveyance, concern spreading that plays out on top of networks with changing architectures over time - commonly known as temporal networks. Assessing a systems proneness to facilitate spreading phenomena, which we refer to as its spreading vulnerability, from its topological information alone remains a challenging task. We report a methodological advance in terms of a novel metric for topological complexity: entanglement entropy. Using publicly available datasets, we demonstrate that the metric naturally allows for topological comparisons across vastly different systems, and importantly, reveals that the spreading vulnerability of a system can be quantitatively related to its topological complexity. In doing so, the metric opens itself for applications in a wide variety of natural, social, biological and engineered systems.
In many real network systems, nodes usually cooperate with each other and form groups, in order to enhance their robustness to risks. This motivates us to study a new type of percolation, group percolation, in interdependent networks under attacks. In this model, nodes belonging to the same group survive or fail together. We develop a theoretical framework for this novel group percolation and find that the formation of groups can improve the resilience of interdependent networks significantly. However, the percolation transition is always of first order, regardless of the distribution of group sizes. As an application, we map the interdependent networks with inter-similarity structures, which attract many attentions very recently, onto the group percolation and confirm the non-existence of continuous phase transitions.
Many real-world networks depend on other networks, often in non-trivial ways, to maintain their functionality. These interdependent networks of networks are often extremely fragile. When a fraction $1-p$ of nodes in one network randomly fails, the damage propagates to nodes in networks that are interdependent and a dynamic failure cascade occurs that affects the entire system. We present dynamic equations for two interdependent networks that allow us to reproduce the failure cascade for an arbitrary pattern of interdependency. We study the rich club effect found in many real interdependent network systems in which the high-degree nodes are extremely interdependent, correlating a fraction $alpha$ of the higher degree nodes on each network. We find a rich phase diagram in the plane $p-alpha$, with a triple point reminiscent of the triple point of liquids that separates a non-functional phase from two functional phases.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
