相关论文: Revisiting finite size effect of percolation in de…

Analytical results are derived for the bond percolation threshold and the size of the giant connected component in a class of random networks with non-zero clustering. The network's degree distribution and clustering spectrum may be…

In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent…

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 introduce an exponential random graph model for networks with a fixed degree distribution and with a tunable degree-degree correlation. We then investigate the nature of a percolation transition in the correlated network with the Poisson…

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…

We propose a maximally disassortative (MD) network model which realizes a maximally negative degree-degree correlation, and study its percolation transition to discuss the effect of a strong degree-degree correlation on the percolation…

We reconsider the problem of percolation on an equilibrium random network with degree-degree correlations between nearest-neighboring vertices focusing on critical singularities at a percolation threshold. We obtain criteria for…

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…

As a fundamental structural transition in complex networks, core percolation is related to a wide range of important problems. Yet, previous theoretical studies of core percolation have been focusing on the classical Erd\H{o}s-R\'enyi…

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…

Complex networks display various types of percolation transitions. We show that the degree distribution and the degree-degree correlation alone are not sufficient to describe diverse percolation critical phenomena. This suggests that a…

We apply a variant of the explosive percolation procedure to large real-world networks, and show with finite-size scaling that the university class, ordinary or explosive, of the resulting percolation transition depends on the structural…

Generally, the threshold of percolation in complex networks depends on the underlying structural characterization. However, what topological property plays a predominant role is still unknown, despite the speculation of some authors that…

We present exact analysis of the physical properties of bimodal networks specified by the two peak degree distribution fully incorporating the degree-degree correlation between node connection. The structure of the correlated bimodal…

We examined the structure of projections of random bipartite networks characterized by the degree distribution of individual and group nodes through the generating function method. We decomposed a projection into two subgraphs, the giant…

We provide arguments for the property of the degree-degree correlations of giant components formed by the percolation process on uncorrelated random networks. Using the generating functions, we derive a general expression for the…

In this paper, we investigate the effect of local structures on network processes. We investigate a random graph model that incorporates local clique structures to deviate from the locally tree-like behavior of most standard random graph…

The critical phase of bond percolation on the random growing tree is examined. It is shown that the root cluster grows with the system size $N$ as $N^\psi$ and the mean number of clusters with size $s$ per node follows a power function $n_s…

Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…

We present an analytical approach for bond percolation on multiplex networks and use it to determine the expected size of the giant connected component and the value of the critical bond occupation probability in these networks. We advocate…