相关论文: $K$-selective percolation: A simple model leading …
We examine the heterogeneous responses of individual nodes in sparse networks to the random removal of a fraction of edges. Using the message-passing formulation of percolation, we discover considerable variation across the network in the…
We introduce a guided network growth model, which we call the degree product rule process, that uses solely local information when adding new edges. For small numbers of candidate edges our process gives rise to a second order phase…
The diffusion and bootstrap percolation models were studied in regular random and Erd\H{o}s-R\'{e}nyi networks using the modified Newman-Ziff algorithms. We calculated the percolation threshold and the order parameter of the percolation…
Percolation establishes the connectivity of complex networks and is one of the most fundamental critical phenomena for the study of complex systems. On simple networks, percolation displays a second-order phase transition; on multiplex…
We present the theory of the k-core pruning process (progressive removal of nodes with degree less than k) in uncorrelated random networks. We derive exact equations describing this process and the evolution of the network structure, and…
Hybrid percolation transitions (HPTs) induced by cascading processes have been observed in diverse complex systems such as $k$-core percolation, breakdown on interdependent networks and cooperative epidemic spreading models. Much effort has…
Heterogeneous k-core percolation is an extension of a percolation model which has interesting applications to the resilience of networks under random damage. In this model, the notion of node robustness is local, instead of global as in…
We introduce a $k$-leaf removal algorithm as a generalization of the so-called leaf removal algorithm. In this pruning algorithm, vertices of degree smaller than $k$, together with their first nearest neighbors and all incident edges are…
Explosive Percolation describes the abrupt onset of large-scale connectivity that results from a simple random process designed to delay the onset of the transition on an underlying random network or lattice. Explosive percolation…
Percolation theory characterizing the robustness of a network has applications ranging from biology, to epidemic spreading, and complex infrastructures. Percolation theory, however, only concern the typical response of a infinite network to…
In this Letter, we show that the explosive percolation is a novel continuous phase transition. The order-parameter-distribution histogram at the percolation threshold is studied in Erd\H{o}s-R\'{e}nyi networks, scale-free networks, and…
We investigate the heterogeneity of outcomes of repeated instances of percolation experiments in complex networks using a message passing approach to evaluate heterogeneous, node dependent probabilities of belonging to the giant or…
We report the discovery of a discrete hierarchy of micro-transitions occurring in models of continuous and discontinuous percolation. The precursory micro-transitions allow us to target almost deterministically the location of the…
In real networks, the dependency between nodes is ubiquitous; however, the dependency is not always complete and homogeneous. In this paper, we propose a percolation model with weak and heterogeneous dependency; i.e., dependency strengths…
A first-order percolation transition, called explosive percolation, was recently discovered in evolution networks with random edge selection under a certain restriction. However, the network percolation with more realistic evolution…
The recent proliferation of correlated percolation models---models where the addition of edges/vertices is no longer independent of other edges/vertices---has been motivated by the quest to find discontinuous percolation transitions. The…
In a new type of percolation phase transition, which was observed in a set of non-equilibrium models, each new connection between vertices is chosen from a number of possibilities by an Achlioptas-like algorithm. This causes preferential…
We compare phase transition and critical phenomena of bond percolation on Euclidean lattices, nonamenable graphs, and complex networks. On a Euclidean lattice, percolation shows a phase transition between the nonpercolating phase and…
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…
$k$-core decomposition is widely used to identify the center of a large network, it is a pruning process in which the nodes with degrees less than $k$ are recursively removed. Although the simplicity and effectiveness of this method…