相关论文: On the Continuity of Enhancement Percolation
Recently, new results on percolation of interdependent networks have shown that the percolation transition can be first order. In this paper we show that, when considering antagonistic interactions between interacting networks, the…
We consider different problems within the general theme of long-range percolation on oriented graphs. Our aim is to settle the so-called truncation question, described as follows. We are given probabilities that certain long-range oriented…
Explosive percolation in a network is a phase transition where a large portion of nodes becomes connected with an addition of a small number of edges. Although extensively studied in random network models and reconstructed real networks,…
Bootstrap percolation is a prominent framework for studying the spreading of activity on a graph. We begin with an initial set of active vertices. The process then proceeds in rounds, and further vertices become active as soon as they have…
The critical phase of bond percolation on the random growing tree is examined. It is shown that the root cluster grows with the system size $N$ as $N^\psi$ and the mean number of clusters with size $s$ per node follows a power function $n_s…
We prove a remarkable combinatorial symmetry in the number of spanning configurations in site percolation: for a large class of lattices, the number of spanning configurations with an odd or even number of occupied sites differs by $\pm 1$.…
We consider the Boolean model on $\R^d$. We prove some equivalences between subcritical percolation properties. Let us introduce some notations to state one of these equivalences. Let $C$ denote the connected component of the origin in the…
Percolation is the simplest fundamental model in statistical mechanics that exhibits phase transitions signaled by the emergence of a giant connected component. Despite its very simple rules, percolation theory has successfully been applied…
We investigate the influence of the range of interactions in the two-dimensional bond percolation model, by means of Monte Carlo simulations. We locate the phase transitions for several interaction ranges, as expressed by the number $z$ of…
We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of the percolation probability above which the giant strongly connected component emerges…
We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…
The Hamming graph $H(d,n)$ is the Cartesian product of $d$ complete graphs on $n$ vertices. Let $m=d(n-1)$ be the degree and $V = n^d$ be the number of vertices of $H(d,n)$. Let $p_c^{(d)}$ be the critical point for bond percolation on…
We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…
The site percolation on the triangular lattice stands out as one of the few exactly solved statistical systems. By initially configuring critical percolation clusters of this model and randomly reassigning the color of each percolation…
We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…
We introduce a new correlated percolation model on the $d$-dimensional lattice $\mathbb{Z}^d$ called the random length worms model. Assume given a probability distribution on the set of positive integers (the length distribution) and $v \in…
Network geometry has strong effects on network dynamics. In particular, the underlying hyperbolic geometry of discrete manifolds has recently been shown to affect their critical percolation properties. Here we investigate the properties of…
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…
We study the accessibility percolation model on infinite trees. The model is defined by associating an absolute continuous random variable $X_v$ to each vertex $v$ of the tree. The main question to be considered is the existence or not of…
We describe the critical behavior of weak multiplex percolation, a generalization of percolation to multiplex or interdependent networks. A node can determine its active or inactive status simply by referencing neighboring nodes. This is…