相关论文: Percolation in networks composed of connectivity a…

Drawing inspiration from real world interacting systems we study a system consisting of two networks that exhibit antagonistic and dependent interactions. By antagonistic and dependent interactions, we mean, that a proportion of functional…

It was recently found that cascading failures can cause the abrupt breakdown of a system of interdependent networks. Using the percolation method developed for single clustered networks by Newman [Phys. Rev. Lett. {\bf 103}, 058701 (2009)],…

Many real-world networks are coupled together to maintain their normal functions. Here we study the robustness of multiplex networks with interdependent and interconnected links under k-core percolation, where a node fails when it connects…

What makes economic and ecological networks so unlike other highly skewed networks in their tendency toward turbulence and collapse? Here, we explore the consequences of a defining feature of these networks: their nodes are tied together by…

We introduce an exponential random graph model for networks with a fixed degree distribution and with a tunable degree-degree correlation. We then investigate the nature of a percolation transition in the correlated network with the Poisson…

A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. We consider the the path-loss plus fading model of wireless signal…

In this study, we investigate bond percolation in networks that have the Poisson degree distribution and a nearest-neighbor degree-degree correlation. Previous numerical studies on percolation critical behaviors of degree-correlated…

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…

Robustness of network of networks (NON) has been studied only for dependency coupling (J.X. Gao et. al., Nature Physics, 2012) and only for connectivity coupling (E.A. Leicht and R.M. D Souza, arxiv:0907.0894). The case of network of n…

Over the years, quantifying the similarity of nodes has been a hot topic in complex networks, yet little has been known about the distributions of node-similarity. In this paper, we consider a typical measure of node-similarity called the…

Real data show that interdependent networks usually involve inter-similarity. Intersimilarity means that a pair of interdependent nodes have neighbors in both networks that are also interdependent (Parshani et al \cite{PAR10B}). For…

For interdependent networks with identity dependency map, percolation is exactly the same with that on a single network and follows a second-order phase transition, while for random dependency, percolation follows a first-order phase…

The existence of inter-dependence between multiple networks imparts an additional scale of complexity to such systems often referred to as `network of networks' (NON). We have investigated the robustness of NONs to random breakdown of their…

We investigate the degree distribution $P(k)$ and the clustering coefficient $C$ of the line graphs constructed on the Erd\"os-R\'enyi networks, the exponential and the scale-free growing networks. We show that the character of the degree…

In this work, we study the percolation transition and large deviation properties of generalized canonical network ensembles. This new type of random networks might have a very rich complex structure, including high heterogeneous degree…

We study the distributions of the resilience of power flow models against transmission line failures via a so-called backup capacity. We consider three ensembles of random networks and in addition, the topology of the British transmission…

In a highly influential paper twenty years ago, Barab\'asi and Albert [Science 286, 509 (1999)] showed that networks undergoing generic growth processes with preferential attachment evolve towards scale-free structures. In any finite…

We study the effect of assortative and disassortative mixing on the robustness of networks under random node failures. For ordinary (dyadic) networks, by using the generating function technique and stochastic simulations, we show that the…

Methods for determining the percolation threshold usually study the behavior of network ensembles and are often restricted to a particular type of probabilistic node/link removal strategy. We propose a network-specific method to determine…

We present exact analysis of the physical properties of bimodal networks specified by the two peak degree distribution fully incorporating the degree-degree correlation between node connection. The structure of the correlated bimodal…