It has been recently shown that the percolation transition is discontinuous in Erdős-Rényi networks and square lattices in two dimensions under the Achlioptas Process (AP). Here, we show that when the structure is highly heterogeneous as in scale-free networks, a discontinuous transition does not always occur: a continuous transition is also possible depending on the degree distribution of the scale-free network. This originates from the competition between the AP that discourages the formation of a giant component and the existence of hubs that encourages it. We also estimate the value of the characteristic degree exponent that separates the two transition types.
We investigate variations of the well-known Achlioptas percolation problem, which uses the method of probing sites when building up a lattice system, or probing links when building a network, ultimately resulting in the delay of the appearance of the critical behavior. In the first variation we use two-dimensional lattices, and we apply reverse rules of the Achlioptas model, thus resulting in a speed-up rather than delay of criticality. In a second variation we apply an attractive (and repulsive) rule when building up the lattice, so that newly added sites are either attracted or repelled by t…
Explosive percolation in the Achlioptas process has recently attracted much research attention. From extensive simulations in an event-based ensemble, we find that, in dimensions from $2$ to $6$ and on random graphs, the Achlioptas processes all have two scaling windows and multiple fractal structures. The mixing of these multiple scalings successfully explains the previously observed anomalous phenomena in the conventional ensemble, and, moreover, correct critical exponents are now determined with a high precision by the event-based method. The multiple scalings and the ensemble inequivalence…
In the usual Achlioptas processes the smallest clusters of a few randomly chosen ones are selected to merge together at each step. The resulting aggregation process leads to the delayed birth of a giant cluster and the so-called explosive percolation transition showing a set of anomalous features. We explore a process with the opposite selection rule, in which the biggest clusters of the randomly chosen ones merge together. We develop a theory of this kind of percolation based on the Smoluchowski equation, find the percolation threshold, and describe the scaling properties of this continuous t…
逾渗是统计物理中研究最多的过程之一。Achlioptas等人最近的一篇论文[Science 323，1453（2009）]表明，如果根据特殊的合作规则（Achlioptas过程）将链接添加到系统中，则通常连续的渗滤过渡变得不连续（“爆炸性”）。在本文中，我们提出了一个详细的数值分析Achlioptas过程的产品规则的各种系统，包括格，随机网络a' la Erdoes-Renyi和无标度网络。在所有情况下，我们恢复Achlioptas等人的爆炸性转变。然而，爆炸渗流过渡是一种混合，尽管在阈值的序参量的不连续性，观察到的痕迹分析行为，如幂律分布的集群大小。特别是，对于度指数λ <3的无标度网络，所有相关的渗流变量都显示幂律标度，就像在连续的二阶相变中一样。
In this work, we study explosive percolation (EP) in Barabási-Albert (BA) network, in which nodes are born with degree $k=m$, for both product rule (PR) and sum rule (SR) of the Achlioptas process. For $m=1$ we find that the critical point $t_c=1$ which is the maximum possible value of the relative link density $t$; Hence we cannot have access to the other phase like percolation in one dimension. However, for $m>1$ we find that $t_c$ decreases with increasing $m$ and the critical exponents $ν, α, β$ and $γ$ for $m>1$ are found to be independent not only of the value of $m$ but also of PR and S…
In this article, we investigate explosive bond percolation (EBP) with product rule, formally known as Achlioptas process, on a scale-free multifractal weighted planar stochastic lattice (WPSL). One of the key features of the EBP transition is the delay, compared to corresponding random bond percolation (RBP), in the onset of spanning cluster. However, when it happens, it happens so dramatically that initially it was believed, albeit ultimately proved wrong, that explosive percolation (EP) exhibits first order transition. In the case of EP, much efforts were devoted to resolving the issue of it…
In some systems, the connecting probability (and thus the percolation process) between two sites depends on the geometric distance between them. To understand such process, we propose gravitationally correlated percolation models for link-adding networks on the two-dimensional lattice $G$ with two strategies $S_{\rm max}$ and $S_{\rm min}$, to add a link $l_{i,j}$ to connect site $i$ and site $j$ with mass $m_i$ and $m_j$, respectively; $m_i$ and $m_j$ are sizes of the clusters which contain site $i$ and site $j$, respectively. The probability to add the link $l_{i,j}$ is related to the genera…
We investigate site percolation on a weighted planar stochastic lattice (WPSL) which is a multifractal and whose dual is a scale-free network. Percolation is typically characterized by percolation threshold $p_c$ and by a set of critical exponents $β$, $γ$, $ν$ which describe the critical behavior of percolation probability $P(p)\sim (p_c-p)^β$, mean cluster size $S\sim (p_c-p)^{-γ}$ and the correlation length $ξ\sim (p_c-p)^{-ν}$. Besides, the exponent $τ$ characterizes the cluster size distribution function $n_s(p_c)\sim s^{-τ}$ and the fractal dimension $d_f$ the spanning cluster. We obtain…
In this article, we investigate both site and bond percolation on a weighted planar stochastic lattice (WPSL) which is a multi-multifractal and whose dual is a scale-free network. The characteristic properties of percolation is that it exhibits threshold phenomena as we find sudden or abrupt jump in spanning probability across $p_c$ accompanied by the divergence of some other observable quantities which is reminiscent of continuous phase transition. Indeed, percolation is characterized by the critical behavior of percolation strength $P(p)\sim (p_c-p)^β$, mean cluster size $S\sim (p_c-p)^{-γ}$…
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 transition for random networks. A question arises as to whether the type of PT is also changed for scale-free (SF) network, because the existence of hubs incites the formation of a giant cluster. Here, we apply a global suppression rule to the static model for SF networks, and investigate properties of the PT. We find that even for SF networks with the degree …
The Gaussian free field (GFF) is considered in the background of random iso-height islands which is modeled by the site percolation with the occupation probability $p$. To realize GFF, we consider the Poisson equation in the presence of normal distributed white-noise charges, as the stationary state of the Edwards-Wilkinson (EW) model. The iso-potential (metallic in the terminology of the electrostatic problem) sites are chosen over the lattice according to the percolation problem, giving rise to some metallic islands and some active (not metallic, nor surrounded by a metallic island) area. We…
Recently Mertens and Moore [arXiv:1909.01484v1] showed that site percolation "is odd." By this they mean that on an $M\times N$ square lattice the number of distinct site configurations that allow for vertical percolation is odd. We report here an alternative proof, based on recursive use of geometric symmetry, for both free and periodic boundary conditions.
We study critical bond percolation on a seven-dimensional (7D) hypercubic lattice with periodic boundary conditions and on the complete graph (CG) of finite volume $V$. We numerically confirm that for both cases, the critical number density $n(s,V)$ of clusters of size $s$ obeys a scaling form $n(s,V) \sim s^{-τ} \tilde{n} (s/V^{d^*_{\rm f}})$ with identical volume fractal dimension $d^*_{\rm f}=2/3$ and exponent $τ= 1+1/d^*_{\rm f}=5/2$. We then classify occupied bonds into {\em bridge} bonds, which includes {\em branch} and {\em junction} bonds, and {\em non-bridge} bonds; a bridge bond is a…
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 critical behaviors. Using the generating function method for bipartite networks, we analytically derive the percolation threshold and the order parameter critical exponent, $β$. For the MD scale-free networks, whose degree distribution is $P(k) \sim k^{-γ}$, we show that the exponent, $β$, for the MD networks and corresponding uncorrelated networks are same for …
Recently the problem of classes of vulnerable vertices (represented by colors) in complex networks has been discussed, where all vertices with the same vulnerability are prone to fail together. Utilizing redundant paths each avoiding one vulnerability (color), a robust color-avoiding connectivity is possible. However, many infrastructure networks show the problem of vulnerable classes of \textit{edges} instead of vertices. Here we formulate color-avoiding percolation for colored edges as well. Additionally, we allow for random failures of vertices or edges. The interplay of random failures and…
The nature of level set percolation in the two-dimension Gaussian Free Field has been an elusive question. Using a loop-model mapping, we show that there is a nontrivial percolation transition, and characterize the critical point. In particular, the correlation length diverges exponentially, and the critical clusters are "logarithmic fractals", whose area scales with the linear size as $A \sim L^2 / \sqrt{\ln L}$. The two-point connectivity also decays as the log of the distance. We corroborate our theory by numerical simulations. Possible CFT interpretations are discussed.
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. Percolation has always been regarded as a substrate-dependent but model-independent process, in the sense that the critical exponents of the transition are determined by the geometry of the system, but they are identical for the bond and site percolation models. Here, we report a violation of such assumption. We provide analytical and numerical evidence of a d…
