Related papers: Non-equilibrium coagulation processes and subcriti…
We analyze the properties of Degree-Ordered Percolation (DOP), a model in which the nodes of a network are occupied in degree-descending order. This rule is the opposite of the much studied degree-ascending protocol, used to investigate…
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 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…
We investigate bond percolation on the non-planar Hanoi network (HN-NP), which was studied in [Boettcher et al. Phys. Rev. E 80 (2009) 041115]. We calculate the fractal exponent of a subgraph of the HN-NP, which gives a lower bound for the…
We numerically study bootstrap percolation on Kleinberg's spatial networks, in which the probability density function of a node to have a long-range link at distance $r$ scales as $P(r)\sim r^{\alpha}$. Setting the ratio of the size of the…
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 this paper, we study a model of long-range site percolation on graphs of bounded degree, namely the Boolean percolation model. In this model, each vertex of an infinite connected graph is the center of a ball of random radius, and…
Irreversible aggregation is revisited in view of recent work on renormalization of complex networks. Its scaling laws and phase transitions are related to percolation transitions seen in the latter. We illustrate our points by giving the…
We perform a principal component analysis (PCA) of two one-dimensional lattice models belonging to distinct nonequilibrium universality classes - directed bond percolation and branching and annihilating random walks with even number of…
We study neural connectivity in cultures of rat hippocampal neurons. We measure the neurons' response to an electric stimulation for gradual lower connectivity, and characterize the size of the giant cluster in the network. The connectivity…
We study the percolation behavior of two interdependent scale-free (SF) networks under random failure of 1-$p$ fraction of nodes. Our results are based on numerical solutions of analytical expressions and simulations. We find that as the…
Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…
We consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $\beta\geq 0$. Intuitively, larger $\beta$ means more randomness. In particular, at $\beta=0$ we start with loops…
The asymptotic behavior of the percolation threshold $p_c$ and its dependence upon coordination number $z$ is investigated for both site and bond percolation on four-dimensional lattices with compact extended neighborhoods. Simple…
Realistic network-like systems are usually composed of multiple networks with interacting relations such as school-enterprise research and development collaboration networks. Here we study the percolation properties of a special kind of…
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…
In recent years, many variants of percolation have been used to study network structure and the behavior of processes spreading on networks. These include bond percolation, site percolation, $k$-core percolation, bootstrap percolation, the…
We study a system composed from two interdependent networks A and B, where a fraction of the nodes in network A depends on the nodes of network B and a fraction of the nodes in network B depends on the nodes of network A. Due to the…
Correlations are known to play a crucial role in determining the structure of complex networks. Here we study how their presence affects the computation of the percolation threshold in random hypergraphs. In order to mimic the correlation…
We study the percolation properties of force networks in an anisotropic model for granular packings, the so-called q-model. Following the original recipe of Ostojic et al. [Nature 439, 828 (2006)], we consider a percolation process in which…