相关论文: Percolation of Partially Interdependent Scale-free…
Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real-life systems. In this work, such process is applied to networks consisting of two types of nodes with edges running only between nodes of…
We consider a one-dimensional network in which the nodes at Euclidean distance $l$ can have long range connections with a probabilty $P(l) \sim l^{-\delta}$ in addition to nearest neighbour connections. This system has been shown to exhibit…
Preferential attachment networks with power law exponent $\tau>3$ are known to exhibit a phase transition. There is a value $\rho_{\rm c}>0$ such that, for small edge densities $\rho\leq \rho_c$ every component of the graph comprises an…
If we add links to a network at random, a critical threshold can be crossed where a giant connected component forms. Conversely, if links or nodes are removed at random, the giant component shrinks and eventually breaks. In this paper, we…
Scale-free networks with small power law exponent are known to be robust, meaning that their qualitative topological structure cannot be altered by random removal of even a large proportion of nodes. By contrast, it has been argued in the…
In many systems consisting of interacting subsystems, the complex interactions between elements can be represented using multilayer networks. However percolation, key to understanding connectivity and robustness, is not trivially…
Scale-free networks arise from power-law degree distributions. Due to the finite size of real-world networks, the power law inevitably has a cutoff at some maximum degree $\Delta$. We investigate the relative size of the giant component $S$…
Multilayer infrastructure is often interdependent, with nodes in one layer depending on nearby nodes in another layer to function. The links in each layer are often of limited length, due to the construction cost of longer links. Here, we…
Extensive research has focused on studying the robustness of interdependent non-directed networks and the design of mitigation strategies aimed at reducing disruptions caused by cascading failures. However, real systems such as power and…
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…
Percolation, the formation of a macroscopic connected component, is a key feature in the description of complex networks. The dynamical properties of a variety of systems can be understood in terms of percolation, including the robustness…
A random graph model on a host graph H is said to be 1-independent if for every pair of vertex-disjoint subsets A,B of E(H), the state of edges (absent or present) in A is independent of the state of edges in B. For an infinite connected…
Percolation and synchronization are two phase transitions that have been extensively studied since already long ago. A classic result is that, in the vast majority of cases, these transitions are of the second-order type, i.e. continuous…
We study the tolerance of random networks to intentional attack, whereby a fraction p of the most connected sites is removed. We focus on scale-free networks, having connectivity distribution of P(k)~k^(-a) (where k is the site…
We investigate quantum percolation in a honeycomb lattice with site dilution and random spin-orbit coupling. Using exact diagonalization combined with finite-size scaling analysis, we study the metal-insulator transition, extracting the…
How does the percolation transition behave in the absence of quenched randomness? To address this question, we study two nonrandom self-dual quasiperiodic models of square-lattice bond percolation. In both models, the critical point has…
Clustering, or transitivity has been observed in real networks and its effects on their structure and function has been discussed extensively. The focus of these studies has been on clustering of single networks while the effect of…
Many interdependent, real-world infrastructures involve interconnections between different communities or cities. Here we study if and how the effects of such interconnections can be described as an external field for interdependent…
We study the mutual percolation of a system composed of two interdependent random regular networks. We introduce a notion of distance to explore the effects of the proximity of interdependent nodes on the cascade of failures after an…
Modeling how networks change under structural perturbations can yield foundational insights into network robustness, which is critical in many real-world applications. The largest connected component is a popular measure of network…