Related papers: Percolation Theory on Interdependent Networks Base…
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…
Multilayer networked systems are ubiquitous in nature and engineering, and the robustness of these systems against failures is of great interest. A main line of theoretical pursuit has been percolation induced cascading failures, where…
We introduce a new percolation model to describe and analyze the spread of an epidemic on a general directed and locally finite graph. We assign a two-dimensional random weight vector to each vertex of the graph in such a way that the…
We develop a methodology for analyzing the percolation phenomena of two mutually coupled (interdependent) networks based on the cavity method of statistical mechanics. In particular, we take into account the influence of degree-degree…
Recently much attention has been paid to the study of the robustness of interdependent and multiplex networks and, in particular, networks of networks. The robustness of interdependent networks can be evaluated by the size of a mutually…
We study the problem of inferring network topology from information cascades, in which the amount of time taken for information to diffuse across an edge in the network follows an unknown distribution. Unlike previous studies, which assume…
In interdependent networks, it is usually assumed, based on percolation theory, that nodes become nonfunctional if they lose connection to the network giant component. However, in reality, some nodes, equipped with alternative resources,…
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…
We consider propagation models that describe the spreading of an attribute, called "damage", through the nodes of a random network. In some systems, the average fraction of nodes that remain undamaged vanishes in the large system limit, a…
Robustness of two coupled networks system has been studied only for dependency coupling (S. Buldyrev et. al., Nature, 2010) and only for connectivity coupling (E. A. Leicht and R. M. D'Souza, arxiv:09070894). Here we study, using a…
We consider robustness and percolation properties of the networks of networks, in which random nodes in different individual networks (layers) can be interdependent. We explore the emergence of the giant mutually connected component,…
During the past two decades, percolation has long served as a basic paradigm for network resilience, community formation and so on in complex systems. While the percolation transition is known as one of the most robust continuous…
Measuring and optimizing the influence of nodes in big-data online social networks are important for many practical applications, such as the viral marketing and the adoption of new products. As the viral spreading on social network is a…
Robustness and cascading failures in interdependent systems has been an active research field in the past decade. However, most existing works use percolation-based models where only the largest component of each network remains functional…
Almost all network research has been focused on the properties of a single network that does not interact and depends on other networks. In reality, many real-world networks interact with other networks. Here we develop an analytical…
The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network [1]; or, if immunized,…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
We present a simple model of network growth and solve it by writing down the dynamic equations for its macroscopic characteristics like the degree distribution and degree correlations. This allows us to study carefully the percolation…
Infectious disease remains, despite centuries of work to control and mitigate its effects, a major problem facing humanity. This paper reviews the mathematical modelling of infectious disease epidemics on networks, starting from the…
Mathematical models of infectious diseases, which are in principle analytically tractable, use two general approaches. The first approach, generally known as compartmental modeling, addresses the time evolution of disease propagation at the…