Related papers: $k$-core percolation on complex networks: Comparin…
We develop the theory of the k-core (bootstrap) percolation on uncorrelated random networks with arbitrary degree distributions. We show that the k-core percolation is an unusual, hybrid phase transition with a jump emergence of the k-core…
Many systems, ranging from engineering to medical to societal, can only be properly characterized by multiple interdependent networks whose normal functioning depends on one another. Failure of a fraction of nodes in one network may lead to…
Modern large network systems normally work in cooperation and incorporate dependencies between their components for purposes of efficiency and regulation. Such dependencies may become a major risk since they can cause small scale failures…
Complex networks have recently attracted much interest due to their prevalence in nature and our daily lives [1, 2]. A critical property of a network is its resilience to random breakdown and failure [3-6], typically studied as a…
Percolation theory characterizing the robustness of a network has applications ranging from biology, to epidemic spreading, and complex infrastructures. Percolation theory, however, only concern the typical response of a infinite network to…
In the real world, the stable operation of a network is usually inseparable from the mutual support of other networks. In such an interdependent network, a node in one layer may depend on multiple nodes in another layer, forming a complex…
The concept of k-core, which indicates the largest induced subgraph where each node has k or more neighbors, plays a significant role in measuring the cohesiveness and the engagement of a network, and it is exploited in diverse…
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…
We model smart grids as complex interdependent networks, and study targeted attacks on smart grids for the first time. A smart grid consists of two networks: the power network and the communication network, interconnected by edges.…
We present analytic and numeric results for percolation in a network formed of interdependent spatially embedded networks. We show results for a treelike and a random regular network of networks each with $(i)$ unconstrained interdependent…
We investigate robustness of correlated networks against propagating attacks modeled by a susceptible-infected-removed model. By Monte-Carlo simulations, we numerically determine the first critical infection rate, above which a global…
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 model the robustness against random failure or intentional attack of networks with arbitrary large-scale structure. We construct a block-based model which incorporates --- in a general fashion --- both connectivity and interdependence…
A central concern of network operators is to estimate the probability of an incident that affects a significant part and thus may yield to a breakdown. We answer this question by modeling how a failure of either a node or an edge will…
Many real world complex systems such as infrastructure, communication and transportation networks are embedded in space, where entities of one system may depend on entities of other systems. These systems are subject to geographically…
The k-core decomposition of a network has thus far mainly served as a powerful tool for the empirical study of complex networks. We now propose its explicit integration in a theoretical model. We introduce a Hard-core Random Network model…
When real networks are considered, coupled networks with connectivity and feedback-dependency links are not rare but more general. Here we develop a mathematical framework and study numerically and analytically percolation of interacting…
We analyze damage nucleation and localization in the random fuse model with strong disorder using numerical simulations. In the initial stages of the fracture process, damage evolves in an uncorrelated manner, resembling percolation.…
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…
An analytical approach to calculating bond percolation thresholds, sizes of $k$-cores, and sizes of giant connected components on structured random networks with non-zero clustering is presented. The networks are generated using a…