Related papers: Generalized percolation in random directed network…
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…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
Let $X$ be either $Z^d$ or the points of a Poisson process in $R^d$ of intensity 1. Given parameters $r$ and $p$, join each pair of points of $X$ within distance $r$ independently with probability $p$. This is the simplest case of a…
During the past two decades, percolation has long served as a basic paradigm for network resilience, community formation and so on in complex systems. While the percolation transition is known as one of the most robust continuous…
We show that to correctly describe the position of the critical line in the Kauffman random boolean networks one must take into account percolation phenomena underlying the process of damage spreading. For this reason, since the issue of…
We study the temporal percolation properties of temporal networks by taking as a representative example the recently proposed activity driven network model [N. Perra et al., Sci. Rep. 2, 469 (2012)]. Building upon an analytical framework…
In this paper, we outline the theory of epidemic percolation networks and their use in the analysis of stochastic SIR epidemic models on undirected contact networks. We then show how the same theory can be used to analyze stochastic SIR…
We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…
We investigate the statistics of articulation points and bredges (bridge-edges) in complex networks in which bonds are randomly removed in a percolation process. Articulation points are nodes in a network which, if removed, would split the…
We introduce a correlated static model and investigate a percolation transition. The model is a modification of the static model and is characterized by assortative degree-degree correlation. As one varies the edge density, the network…
These lectures give an introduction to the methods of conformal field theory as applied to deriving certain results in two-dimensional critical percolation: namely the probability that there exists at least one cluster connecting two…
Many complex networks exhibit a percolation transition involving a macroscopic connected component, with universal features largely independent of the microscopic model and the macroscopic domain geometry. In contrast, we show that the…
These lectures provide an introduction to the directed percolation and directed animals problems, from a physicist's point of view. The probabilistic cellular automaton formulation of directed percolation is introduced. The planar duality…
We study the edge deletion process of random graphs near a k-core percolation point. We find that the time-dependent number of edges in the process exhibits critically divergent fluctuations. We first show theoretically that the k-core…
We consider percolation on interdependent locally treelike networks, recently introduced by Buldyrev et al., Nature 464, 1025 (2010), and demonstrate that the problem can be simplified conceptually by deleting all references to cascades of…
The threshold network model is a type of finite random graphs. In this paper, we introduce a generalized threshold network model. A pair of vertices with random weights is connected by an edge when real-valued functions of the pair of…
Directed and heterogeneous hypergraphs capture directional higher-order interactions with intrinsically asymmetric functional dependencies among nodes. As a result, damage to certain nodes can suppress entire hyperedges, whereas failure of…
In the presented article, statistical properties regarding the topology and standard percolation on relative neighborhood graphs (RNGs) for planar sets of points, considering the Euclidean metric, are put under scrutiny. RNGs belong to the…
We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for…
Percolation theory can be used to describe the structural properties of complex networks using the generating function formulation. This mapping assumes that the network is locally tree-like and does not contain short-range loops between…