Extended-range percolation is a robust percolation process that has relevance for quantum communication problems. In extended-range percolation nodes can be trusted or untrusted. Untrusted facilitator nodes are untrusted nodes that can still allow communication between trusted nodes if they lie on a path of distance at most R between two trusted nodes. In extended-range percolation the extended-range giant component (ERGC) includes trusted nodes connected by paths of trusted and untrusted facilitator nodes. Here, based on a message passing algorithm, we develop a general theory of extended-range percolation, valid for arbitrary values of R as long as the networks are locally tree-like. This general framework allows us to investigate the properties of extended-range percolation on interdependent multiplex networks. While the extended-range nature makes multiplex networks more robust, interdependency makes them more fragile. From the interplay between these two effects a rich phase diagram merges including discontinuous phase transitions and reentrant phases. The theoretical predictions are in excellent agreement with extensive Monte-Carlo simulations. The proposed exactly solvable model constitutes a fundamental reference for the study of models defined through properties of extended-range paths.
Recently increasing attention has been addressed to the fluctuations observed in percolation defined in single and multiplex networks. These fluctuations are extremely important to characterize the robustness of real finite networks but cannot be captured by the traditionally adopted mean-field theory of percolation. Here we propose a theoretical framework and a message passing algorithm that is able to fully capture the large deviation of percolation in interdependent multiplex networks with a locally tree-like structure. This framework is here applied to study the robustness of single instan…
Multiplex networks describe a large variety of complex systems including infrastructures, transportation networks and biological systems. Most of these networks feature a significant link overlap. It is therefore of particular importance to characterize the mutually connected giant component in these networks. Here we provide a message passing theory for characterizing the percolation transition in multiplex networks with link overlap and an arbitrary number of layers $M$. Specifically we propose and compare two message passing algorithms, that generalize the algorithm widely used to study the…
From transportation networks to complex infrastructures, and to social and communication networks, a large variety of systems can be described in terms of multiplexes formed by a set of nodes interacting through different networks (layers). Multiplexes may display an increased fragility with respect to the single layers that constitute them. However, so far the overlap of the links in different layers has been mostly neglected, despite the fact that it is an ubiquitous phenomenon in most multiplexes. Here we show that the overlap among layers can improve the robustness of interdependent multip…
We describe the critical behavior of weak multiplex percolation, a generalization of percolation to multiplex or interdependent networks. A node can determine its active or inactive status simply by referencing neighboring nodes. This is not the case for the more commonly studied generalization of percolation to multiplex networks, the mutually connected clusters, which requires an interconnecting path within each layer between any two vertices in the giant mutually connected component. We study the emergence of a giant connected component of active nodes under the weak percolation rule, findi…
We present an exact mathematical framework able to describe site-percolation transitions in real multiplex networks. Specifically, we consider the average percolation diagram valid over an infinite number of random configurations where nodes are present in the system with given probability. The approach relies on the locally treelike ansatz, so that it is expected to accurately reproduce the true percolation diagram of sparse multiplex networks with negligible number of short loops. The performance of our theory is tested in social, biological, and transportation multiplex graphs. When compare…
The "SOS" in the title does not refer to the international distress signal, but to "solid-on-solid" (SOS) surface growth. The catastrophic cascades are those observed by Buldyrev {\it et al.} in interdependent networks, which we re-interpret as multiplex networks with agents that can only survive if they mutually support each other, and whose survival struggle we map onto an SOS type growth model. This mapping not only reveals non-trivial structures in the phase space of the model, but also leads to a new and extremely efficient simulation algorithm. We use this algorithm to study interdepende…
We reveal large fluctuations in the response of real multiplex networks to random damage of nodes. These results indicate that the average response to random damage, traditionally considered in mean-field approaches to percolation, is a poor metric of system robustness. We show instead that a large deviation approach to percolation provides a more accurate characterization of system robustness. We identify an effective percolation threshold at which we observe a clear abrupt transition separating two distinct regimes in which the most likely response to damage is either a functional or a disma…
Many real-world complex systems are best modeled by multiplex networks. The multiplexity has proved to have broad impact on the system's structure and function. Most theoretical studies on multiplex networks to date, however, have largely ignored the effect of link overlap across layers despite strong empirical evidences for its significance. In this article, we investigate the effect of link overlap in the viability of multiplex networks, both analytically and numerically. Distinctive role of overlapping links in viability and mutual connectivity is emphasized and exploited for setting up pro…
The structure of interconnected systems and its impact on the system dynamics is a much-studied cross-disciplinary topic. Although various critical phenomena have been found in different models, the study on the connections between different percolation transitions is still lacking. Here we propose a unified framework to study the origins of the discontinuous transitions of the percolation process on interacting networks. The model evolves in generations with the result of the present percolation depending on the previous state and thus is history-dependent. Both theoretical analysis and Monte…
Multilayer networks have been found to be prone to abrupt cascading failures under random and targeted attacks, but most of the targeting algorithms proposed so far have been mainly tested on uncorrelated systems. Here we show that the size of the critical percolation set of a multilayer network is substantially affected by the presence of inter-layer degree correlations and edge overlap. We provide extensive numerical evidence which confirms that the state-of-the-art optimal percolation strategies consistently fail to identify minimal percolation sets in synthetic and real-world correlated mu…
We study bond percolation on the simple cubic (SC) lattice with various combinations of first, second, third, and fourth nearest-neighbors by Monte Carlo simulation. Using a single-cluster growth algorithm, we find precise values of the bond thresholds. Correlations between percolation thresholds and lattice properties are discussed, and our results show that the percolation thresholds of these and other three-dimensional lattices decrease monotonically with the coordination number $z$ quite accurately according to a power law $p_{c} \sim z^{-a}$, with exponent $a = 1.111$. However, for large …
By means of Monte Carlo simulations, we study long-range site percolation on square and simple cubic lattices with various combinations of nearest neighbors, up to the eighth neighbors for the square lattice and the ninth neighbors for the simple cubic lattice. We find precise thresholds for 23 systems using a single-cluster growth algorithm. Site percolation on lattices with compact neighborhoods can be mapped to problems of lattice percolation of extended shapes, such as disks and spheres, and the thresholds can be related to the continuum thresholds $η_c$ for objects of those shapes. This m…
Network geometry has strong effects on network dynamics. In particular, the underlying hyperbolic geometry of discrete manifolds has recently been shown to affect their critical percolation properties. Here we investigate the properties of link percolation in non-amenable two-dimensional branching simplicial and cell complexes, i.e., simplicial and cell complexes in which the boundary scales like the volume. We establish the relation between the equations determining the percolation probability in random branching cell complexes and the equation for interdependent percolation in multiplex netw…
$k$-Core percolation has served as a paradigmatic model of discontinuous percolation for a long time. Recently it was revealed that the order parameter of $k$-core percolation of random networks additionally exhibits critical behavior. Thus $k$-core percolation exhibits a hybrid phase transition. Unlike the critical behaviors of ordinary percolation that are well understood, those of hybrid percolation transitions have not been thoroughly understood yet. Here, we investigate the critical behavior of $k$-core percolation of Erdős-Rényi networks. We find numerically that the fluctuations of the …
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 connected component when a fraction of nodes have been removed from these networks. Here we characterize the emergence of the mutually connected component in a network of networks in which every node of a network (layer) $α$ is connected with $q_α$ randomly chosen replicas in some other networks and is interdependent of these nodes with probability $r$. We find…
The asymptotic behavior of the percolation threshold $p_c$ and its dependence upon coordination number $z$ is investigated for both site and bond percolation on four-dimensional lattices with compact extended neighborhoods. Simple hypercubic lattices with neighborhoods up to 9th nearest neighbors are studied to high precision by means of Monte-Carlo simulations based upon a single-cluster growth algorithm. For site percolation, an asymptotic analysis confirms the predicted behavior $zp_c \sim 16 η_c = 2.086$ for large $z$, and finite-size corrections are accounted for by forms $p_c \sim 16 η_c…
Extended-range percolation on various regular lattices, including all eleven Archimedean lattices in two dimensions, and the simple cubic (SC), body-centered cubic (BCC), and face-centered cubic (FCC) lattices in three dimensions, is investigated. In two dimensions, correlations between coordination number $z$ and site thresholds $p_c$ for Archimedean lattices up to 10th nearest neighbors (NN) are seen by plotting $z$ versus $1/p_{c}$ and $z$ versus $-1/\ln(1-p_c)$, using the data of d'Iribarne et al. [J. Phys. A 32:2611, 1999] and others. The results show that all the plots overlap on a line …
Percolation establishes the connectivity of complex networks and is one of the most fundamental critical phenomena for the study of complex systems. On simple networks, percolation displays a second-order phase transition; on multiplex networks, the percolation transition can become discontinuous. However, little is known about percolation in networks with higher-order interactions. Here, we show that percolation can be turned into a fully-fledged dynamical process when higher-order interactions are taken into account. By introducing signed triadic interactions, in which a node can regulate th…
We study the nature of the synchronization transition in spatially extended systems by discussing a simple stochastic model. An analytic argument is put forward showing that, in the limit of discontinuous processes, the transition belongs to the directed percolation (DP) universality class. The analysis is complemented by a detailed investigation of the dependence of the first passage time for the amplitude of the difference field on the adopted threshold. We find the existence of a critical threshold separating the regime controlled by linear mechanisms from that controlled by collective phen…
In the analysis of the robustness of multiplex networks, it is commonly assumed that a node is functioning only if its interdependent nodes are simultaneously functioning. According to this model, a multiplex network becomes more and more fragile as the number of layers increases. In this respect, the addition of a new layer of interdependent nodes to a preexisting multiplex network will never improve its robustness. Whereas such a model seems appropriate to understand the effect of interdependencies in the simplest scenario of a network composed of only two layers, it may seem not suitable to…
Nexus-CAT: A Computational Framework to Define Long-Range Structural Descriptors in Glassy Materials from Percolation Theory
Laboratoire Charles Coulomb, CNRS - University of Montpellier（夏尔·库隆实验室，法国国家科学研究中心-蒙彼利埃大学）；Departamento de Física, Universidad Simón Bolívar（西蒙玻利瓦尔大学物理系）
It was pointed out by de Arcangelis et al. [Europhys. Lett. 14 (1991), 515] that the correct understanding of the percolation phenomenon of the Fortuin-Kasteleyn cluster in the Edwards-Anderson model is important since a dynamical transition, which is characterized by a parameter called the Hamming distance or damage, and the percolation transition are related to a transition for a signal propagating between spins. We show analytically the percolation thresholds of the Fortuin-Kasteleyn cluster for a Potts gauge glass model, which is an extended model of the Edwards-Anderson model, on random g…
Recently, the percolation transition has been characterized on interacting networks both in presence of interdependent and antagonistic interactions. Here we characterize the phase diagram of the percolation transition in two Poisson interdependent networks with a percentage q of antagonistic nodes. We show that this system can present a bistability of the steady state solutions, and both first, and second order phase transitions. In particular, we observe a bistability of the solutions in some regions of the phase space also for a small fraction of antagonistic interactions 0<q<0.4. Moreover,…
Abrupt transitions are ubiquitous in the dynamics of complex systems. Finding precursors, i.e. early indicators of their arrival, is fundamental in many areas of science ranging from electrical engineering to climate. However, obtaining warnings of an approaching transition well in advance remains an elusive task. Here we show that a functional network, constructed from spatial correlations of the system's time series, experiences a percolation transition way before the actual system reaches a bifurcation point due to the collective phenomena leading to the global change. Concepts from percola…
We extend the model of a 2$d$ solid to include a line of defects. Neighboring atoms on the defect line are connected by ?springs? of different strength and different cohesive energy with respect to the rest of the system. Using the Migdal-Kadanoff renormalization group we show that the elastic energy is an irrelevant field at the bulk critical point. For zero elastic energy this model reduces to the Potts model. By using Monte Carlo simulations of the 3- and 4-state Potts model on a square lattice with a line of defects, we confirm the renormalization-group prediction that for a defect interac…
Extended-range percolation on lattices with cubic and non-compact neighborhoods in three dimensions
School of Physics Science and Technology, Yangzhou University（扬州大学物理科学与技术学院）；School of Material Sciences and Physics, China University of Mining and Technology（中国矿业大学物质科学与物理工程学院）
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 fragile to percolation and first-neighbor failure propagation, but little is known about how they respond to non-local disruptions, as it occurs in failures induced by flow redistribution, for example. Acknowledging that many socio-technical and biological systems sustain a flow of some physical quantity, such as energy or information, across the their compone…
We study long-range power-law correlated disorder on square and cubic lattices. In particular, we present high-precision results for the percolation thresholds and the fractal dimension of the largest clusters as function of the correlation strength. The correlations are generated using a discrete version of the Fourier filtering method. We consider two different metrics to set the length scales over which the correlations decay, showing that the percolation thresholds are highly sensitive to such system details. By contrast, we verify that the fractal dimension $d_{\rm f}$ is a universal quan…
We study "tricolor percolation" on the regular tessellation of R^3 by truncated octahedra, which is the three-dimensional analog of the hexagonal tiling of the plane. We independently assign one of three colors to each cell according to a probability vector p = (p_1, p_2, p_3) and define a "tricolor edge" to be an edge incident to one cell of each color. The tricolor edges form disjoint loops and/or infinite paths. These loops and paths have been studied in the physics literature, but little has been proved mathematically. We show that each p belongs to either the compact phase (in which the l…
Since the discovery a half century ago that 1/r^2-type long-range interactions in the one-dimensional Ising model change the phase transition type, long-range interactions in diverse systems have received considerable attention. Recently, this interest extended to global suppression dynamics in the percolation transition, which changes a second-order transition to first order. Here, we investigate how the Berezinskii-Kosterlitz-Thouless (BKT) transition is changed by the global suppression effect. In fact, this effect often arises in real-world complex systems, yet it is not appropriately acco…
Hefei National Laboratory for Physical Sciences at the Microscale and Department of Modern Physics, University of Science and Technology of China（中国科学技术大学现代物理系及微尺度物质科学国家实验室）；Hefei National Laboratory, University of Science and Technology of China（中国科学技术大学合肥国家实验室）；Minjiang Collaborative Center for Theoretical Physics, College of Physics and Electronic Information Engineering, Minjiang University（闽江学院物理与电子信息工程学院理论物理协同创新中心）；School of Systems Science, Beijing Normal University（北京师范大学系统科学学院）
