相关论文: $K$-selective percolation: A simple model leading …

We introduce models of generic rigidity percolation in two dimensions on hierarchical networks, and solve them exactly by means of a renormalization transformation. We then study how the possibility for the network to self organize in order…

Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real-life systems. In this work, such process is applied to networks consisting of two types of nodes with edges running only between nodes of…

We propose a model for evolution aiming to reproduce statistical features of fossil data, in particular the distributions of extinction events, the distribution of species per genus and the distribution of lifetimes, all of which are known…

Percolation transition (PT) means the formation of a macroscopic-scale large cluster, which exhibits a continuous transition. However, when the growth of large clusters is globally suppressed, the type of PT is changed to a discontinuous…

Simulating percolation and critical phenomena of labelled species inside films composed of single-component linear homogeneous macromolecules using molecular Monte Carlo method in 3 dimensions, we study dependence of these conducting…

Percolation on complex networks is used both as a model for dynamics on networks, such as network robustness or epidemic spreading, and as a benchmark for our models of networks, where our ability to predict percolation measures our ability…

The k-core decomposition of a network has thus far mainly served as a powerful tool for the empirical study of complex networks. We now propose its explicit integration in a theoretical model. We introduce a Hard-core Random Network model…

It has been recently shown that the percolation transition is discontinuous in Erd\H{o}s-R\'enyi networks and square lattices in two dimensions under the Achlioptas Process (AP). Here, we show that when the structure is highly heterogeneous…

We consider a modification of the contact process incorporating higher-order reaction terms. The original contact process exhibits a non-equilibrium phase transition belonging to the universality class of directed percolation. The…

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…

In many network applications nodes are stable provided they have at least k neighbors, and a network of k-stable nodes is called a k-core. The vulnerability to random attack is characterized by the size of culling avalanches which occur…

We simulate the two-dimensional XY model in the flow representation by a worm-type algorithm, up to linear system size $L=4096$, and study the geometric properties of the flow configurations. As the coupling strength $K$ increases, we…

The models of $k$-core percolation and interdependent networks (IN) have been extensively studied in their respective fields. A recent study has revealed that they share several common critical exponents. However, several newly discovered…

Extraction of interaction networks from multi-variate time-series is one of the topics of broad interest in complex systems. Although this method has a wide range of applications, most of the previous analyses have focused on the pairwise…

In the modeling, monitoring, and control of complex networks, a fundamental problem concerns the comprehensive determination of the state of the system from limited measurements. Using power grids as example networks, we show that this…

Percolation theory is an approach to study vulnerability of a system. We develop analytical framework and analyze percolation properties of a network composed of interdependent networks (NetONet). Typically, percolation of a single network…

Almost all network research has been focused on the properties of a single network that does not interact and depends on other networks. In reality, many real-world networks interact with other networks. Here we develop an analytical…

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…

We study a dependent site percolation model on the $n$-dimensional Euclidean lattice where, instead of single sites, entire hyperplanes are removed independently at random. We extend the results about Bernoulli line percolation showing that…

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…