相关论文: Robustness of partially interdependent network for…

It was recently found that cascading failures can cause the abrupt breakdown of a system of interdependent networks. Using the percolation method developed for single clustered networks by Newman [Phys. Rev. Lett. {\bf 103}, 058701 (2009)],…

Clustering network is one of which complex network attracting plenty of scholars to discuss and study the structures and cascading process. We primarily analyzed the effect of clustering coefficient to other various of the single clustering…

The social networks that infectious diseases spread along are typically clustered. Because of the close relation between percolation and epidemic spread, the behavior of percolation in such networks gives insight into infectious disease…

The internal organization of complex networks often has striking consequences on either their response to external perturbations or on their dynamical properties. In addition to small-world and scale-free properties, clustering is the most…

We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant…

We develop a full theoretical approach to clustering in complex networks. A key concept is introduced, the edge multiplicity, that measures the number of triangles passing through an edge. This quantity extends the clustering coefficient in…

The percolation properties of clustered networks are analyzed in detail. In the case of weak clustering, we present an analytical approach that allows to find the critical threshold and the size of the giant component. Numerical simulations…

We consider robustness and percolation properties of the networks of networks, in which random nodes in different individual networks (layers) can be interdependent. We explore the emergence of the giant mutually connected component,…

Robustness of two coupled networks system has been studied only for dependency coupling (S. Buldyrev et. al., Nature, 2010) and only for connectivity coupling (E. A. Leicht and R. M. D'Souza, arxiv:09070894). Here we study, using a…

Turing instability in complex networks have been shown in the literature to be dominated by the distribution of the nodal degrees. The conditions for Turing instability have been derived with an explicit dependence on the eigenvalues of the…

The question of how clustering (non-zero density of triangles) in networks affects their bond percolation threshold has important applications in a variety of disciplines. Recent advances in modelling highly-clustered networks are employed…

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…

We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…

In this paper, we propose a novel statistic of networks, the normalized clustering coefficient, which is a modified version of the clustering coefficient that is robust to network size, network density and degree heterogeneity under…

An analytical approach to calculating bond percolation thresholds, sizes of $k$-cores, and sizes of giant connected components on structured random networks with non-zero clustering is presented. The networks are generated using a…

We study the percolation in coupled networks with both inner-dependency and inter-dependency links, where the inner- and inter-dependency links represent the dependencies between nodes in the same or different networks, respectively. We…

Percolation is a fundamental concept that brought new understanding on the robustness properties of complex systems. Here we consider percolation on weakly interacting networks, that is, network layers coupled together by much less…

In many real network systems, nodes usually cooperate with each other and form groups, in order to enhance their robustness to risks. This motivates us to study a new type of percolation, group percolation, in interdependent networks under…

We study a problem of failure of two interdependent networks in the case of correlated degrees of mutually dependent nodes. We assume that both networks (A and B) have the same number of nodes $N$ connected by the bidirectional dependency…

Usual formulations of the clustering coefficient can be shown to be insufficient in the task of describing the local topology of very simple networks. Motivated by this, we review some alternatives in order to present an extension, the…