相关论文: Percolation of Partially Interdependent Scale-free…
A hierarchical froth model of the interface of a random $q$-state Potts ferromagnet in $2D$ is studied by recursive methods. A fraction $p$ of the nearest neighbour bonds is made inaccessible to domain walls by infinitely strong…
It is known that the critical probability for the percolation transition is not a sharp threshold, actually it is a region of non-zero width $\Delta p_c$ for systems of finite size. Here we present evidence that for complex networks $\Delta…
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…
We reveal the nature of the avalanche collapse of the giant viable component in multiplex networks under perturbations such as random damage. Specifically, we identify latent critical clusters associated with the avalanches of random…
We propose a novel finite size scaling analysis for percolation transition observed in complex networks. While it is known that cooperative systems in growing networks often undergo an infinite order transition with inverted…
Interdependent networks are ubiquitous in our society, ranging from infrastructure to economics, and the study of their cascading behaviors using percolation theory has attracted much attention in the recent years. To analyze the…
We study the emergence of a giant component in a spatial network where the distribution of the metric distances between the nodes is scale-invariant, and the interaction between the nodes has a long-range power-law behavior. The nodes are…
We study the cascading failures in a system composed of two interdependent square lattice networks A and B placed on the same Cartesian plane, where each node in network A depends on a node in network B randomly chosen within a certain…
We study, both analytically and numerically, the cascade of failures in two coupled network systems A and B, where multiple support-dependent relations are randomly built between nodes of networks A and B. In our model we assume that each…
Interdependencies are ubiquitous throughout the world. Every real-world system interacts with and is dependent on other systems, and this interdependency affects their performance. In particular, interdependencies among networks make them…
We propose an interdependent random geometric graph (RGG) model for interdependent networks. Based on this model, we study the robustness of two interdependent spatially embedded networks where interdependence exists between geographically…
The instability introduced in a large scale-free network by the triggering of node-breaking avalanches is analyzed using the fiber-bundle model as conceptual framework. We found, by measuring the size of the giant component, the avalanche…
Percolation in a scale-free hierarchical network is solved exactly by renormalization-group theory, in terms of the different probabilities of short-range and long-range bonds. A phase of critical percolation, with algebraic…
The functionality of nodes in a network is often described by the structural feature of belonging to the giant component. However, when dealing with problems like transport, a more appropriate functionality criterion is for a node to belong…
In this paper, we study the critical behavior of percolation on a configuration model with degree distribution satisfying an infinite second-moment condition, which includes power-law degrees with exponent $\tau \in (2,3)$. It is well known…
Networks are ubiquitous in diverse real-world systems. Many empirical networks grow as the number of nodes increases with time. Percolation transitions in growing random networks can be of infinite order. However, when the growth of large…
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. Assuming that the nodes of the wireless network are distributed as a…
We study the percolation phase transition in hierarchical scale-free nets. Depending on the method of construction, the nets can be fractal or small-world (the diameter grows either algebraically or logarithmically with the net size),…
\emph{Full-bond percolation} with parameter $p$ is the process in which, given a graph, for every edge independently, we delete the edge with probability $1-p$. Bond percolation is motivated by problems in mathematical physics and it is…
Consider growing a network, in which every new connection is made between two disconnected nodes. At least one node is chosen randomly from a subset consisting of $g$ fraction of the entire population in the smallest clusters. Here we show…