Related papers: Percolation in real multiplex networks
Complex networks display various types of percolation transitions. We show that the degree distribution and the degree-degree correlation alone are not sufficient to describe diverse percolation critical phenomena. This suggests that a…
We provide a simple proof that graphs in a general class of self-similar networks have zero percolation threshold. The considered self-similar networks include random scale-free graphs with given expected node degrees and zero clustering,…
Understanding the structural complexity and predictability of complex networks is a central challenge in network science. Although recent studies have revealed a relationship between compression-based entropy and link prediction…
Percolation processes on random networks have been the subject of intense research activity over the last decades: the overall phenomenology of standard percolation on uncorrelated and unclustered topologies is well known. Still some…
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…
We report the discovery of a discrete hierarchy of micro-transitions occurring in models of continuous and discontinuous percolation. The precursory micro-transitions allow us to target almost deterministically the location of the…
Many real-world complex systems are best modeled by multiplex networks of interacting network layers. The multiplex network study is one of the newest and hottest themes in the statistical physics of complex networks. Pioneering studies…
We introduce a new approach to connectivity-dependent properties of diluted systems, which is based on the transfer-matrix formulation of the percolation problem. It simultaneously incorporates the connective properties reflected in…
We investigate the behavior of extended urban traffic networks within the framework of percolation theory by using real and synthetic traffic data. Our main focus shifts from the statistical properties of the cluster size distribution…
Real world complex networks often exhibit multiplex structure, connecting entities from different aspects of physical systems such as social, transportation and biological networks. Little is known about general properties of such networks…
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 entanglement distribution in quantum complex networks where nodes are connected by bipartite entangled states. These networks are characterized by a complex structure, which dramatically affects how information is transmitted…
Percolation on two-dimensional small-world networks has been proposed as a model for the spread of plant diseases. In this paper we give an analytic solution of this model using a combination of generating function methods and high-order…
Percolation on complex networks has been used to study computer viruses, epidemics, and other casual processes. Here, we present conditions for the existence of a network specific, observation dependent, phase transition in the updated…
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…
Multilayer systems are coupled networks characterized by different contexts (layers) of interaction and have gained much attention recently due to their suitability to describe a broad spectrum of empirical complex systems. They are very…
Percolation theory concerns the emergence of connected clusters that percolate through a networked system. Previous studies ignored the effect that a node outside the percolating cluster may actively induce its inside neighbours to exit the…
The self-consistent probabilistic approach has proven itself powerful in studying the percolation behavior of interdependent or multiplex networks without tracking the percolation process through each cascading step. In order to understand…
The traditional node percolation map of directed networks is reanalyzed in terms of edges. In the percolated phase, edges can mainly organize into five distinct giant connected components, interfaces bridging the communication of nodes in…
We define an approach to identify overlapping communities in multiplex networks, extending the popular clique percolation method for simple graphs. The extension requires to rethink the basic concepts on which the clique percolation…