相关论文: $K$-selective percolation: A simple model leading …
The stochastic addition of either vertices or connections in a network leads to the observation of the percolation transition, a structural change with the appearance of a connected component encompassing a finite fraction of the system.…
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…
We consider a network, bonds of which are being sequentially removed; that is done at random, but conditioned on the system remaining connected (Self-Repairing Bond Percolation SRBP). This model is the simplest representative of a class of…
In recent years, neural networks have increasingly been employed to identify critical points of phase transitions. For the tricritical directed percolation model, its steady-state configurations encompass both first-order and second-order…
A random growth lattice filling model of percolation with touch and stop growth rule is developed and studied numerically on a two dimensional square lattice. Nucleation centers are continuously added one at a time to the empty sites and…
The one-dimensional kinetic contact process with parallel update is introduced and studied by the mean-field approximation and Monte Carlo (MC) simulations. Contrary to a more conventional scenario with single active phase for 1d models…
Percolation in complex networks is viewed as both: a process that mimics network degradation and a tool that reveals peculiarities of the underlying network structure. During the course of percolation, networks undergo non-trivial…
We consider a natural variant of the Erd\H{o}s-R\'enyi random graph process in which $k$ vertices are special and are never put into the same connected component. The model is natural and interesting on its own, but is actually inspired by…
How the giant component of a network disappears under attacking nodes or links addresses a key aspect of network robustness, which can be framed into percolation problems. Various strategies to select the node to be deactivated have been…
We study the emergence of a giant component in a spatial network where the distribution of the metric distances between the nodes is scale-invariant, and the interaction between the nodes has a long-range power-law behavior. The nodes are…
We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree $k$. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks. We find that for any…
Percolation on complex networks has been used to study computer viruses, epidemics, and other casual processes. Here, we present conditions for the existence of a network specific, observation dependent, phase transition in the updated…
We study tolerance and topology of random scale-free networks under attack and defense strategies that depend on the degree k of the nodes. This situation occurs, for example, when the robustness of a node depends on its degree or in an…
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 study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the…
The physics of $k$-core percolation pertains to those systems whose constituents require a minimum number of $k$ connections to each other in order to participate in any clustering phenomenon. Examples of such a phenomenon range from…
We consider propagation models that describe the spreading of an attribute, called "damage", through the nodes of a random network. In some systems, the average fraction of nodes that remain undamaged vanishes in the large system limit, a…
We revisit the phase transition for percolation on randomly stretched lattices. Starting with the usual square grid, keep all vertices untouched while erasing edges according as follows: for every integer $i$, the entire column of vertical…
Percolation has long served as a model for diverse phenomena and systems. The percolation transition, that is, the formation of a giant cluster on a macroscopic scale, is known as one of the most robust continuous transitions. Recently,…
Multiplex networks describe a large variety of complex systems including infrastructures, transportation networks and biological systems. Most of these networks feature a significant link overlap. It is therefore of particular importance to…