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

Complex networks have recently attracted much interest due to their prevalence in nature and our daily lives [1, 2]. A critical property of a network is its resilience to random breakdown and failure [3-6], typically studied as a…

The use of degree-degree correlations to model realistic networks which are characterized by their Pearson's coefficient, has become widespread. However the effect on how different correlation algorithms produce different results on…

Interdependent networks are characterized by two kinds of interactions: The usual connectivity links within each network and the dependency links coupling nodes of different networks. Due to the latter links such networks are known to…

We study Erd\"{o}s-R\'enyi random graphs with random weights associated with each link. We generate a new ``Supernode network'' by merging all nodes connected by links having weights below the percolation threshold (percolation clusters)…

We describe the anomalous phase transition of the emergence of the giant connected component in scale-free networks growing under mechanism of preferential linking. We obtain exact results for the size of the giant connected component and…

We study the mutual percolation of two interdependent lattice networks ranging from two to seven dimensions, denoted as $D$. We impose that the length of interdependent links connecting nodes in the two lattices be less than or equal to a…

We developed a scheme for evaluating the size of the largest connected subnetwork (giant component) in random networks and the percolation threshold when sites (nodes) and/or bonds (edges) are removed from the networks based on the cavity…

We discuss two sampling schemes for selecting random subnets from a network: Random sampling and connectivity dependent sampling, and investigate how the degree distribution of a node in the network is affected by the two types of sampling.…

Networks growing according to the rule that every new node has a probability p_k of being attached to k preexisting nodes, have a universal phase diagram and exhibit power law decays of the distribution of cluster sizes in the…

In the real world, the stable operation of a network is usually inseparable from the mutual support of other networks. In such an interdependent network, a node in one layer may depend on multiple nodes in another layer, forming a complex…

A common way of classifying network connectivity is the association of the nodal degree distribution to specific probability distribution models. During the last decades, researchers classified many networks using the Poisson or Pareto…

We study a model for coupled networks introduced recently by Buldyrev et al., Nature 464, 1025 (2010), where each node has to be connected to others via two types of links to be viable. Removing a critical fraction of nodes leads to a…

We explore the relation between the topological relevance of a node in a complex network and the individual dynamics it exhibits. When the system is weakly coupled, the effect of the coupling strength against the dynamical complexity of the…

We study the problem of wireless network resilience to node failures from a percolation-based perspective. In practical wireless networks, it is often the case that the failure probability of a node depends on its degree (number of…

We analyze the properties of Degree-Ordered Percolation (DOP), a model in which the nodes of a network are occupied in degree-descending order. This rule is the opposite of the much studied degree-ascending protocol, used to investigate…

Research on the vulnerability of electric networks with a complex network approach has produced significant results in the last decade, especially for transmission networks. These studies have shown that there are causal relations between…

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…

With a simple model, we study the evolution of random networks under attack and reconstruction. We introduce a new quality, invulnerability I(s), to describe the stability of the system. We find that the network can evolve to a stationary…

Perturbations made to networked systems may result in partial structural loss, such as a blackout in a power-grid system. Investigating the resultant disturbance in network properties is quintessential to understand real networks in action.…

Networks with a given degree distribution may be very resilient to one type of failure or attack but not to another. The goal of this work is to determine network design guidelines which maximize the robustness of networks to both random…