We present a method of general applicability for finding exact or accurate approximations to bond percolation thresholds for a wide class of lattices. To every lattice we sytematically associate a polynomial, the root of which in $[0,1]$ is the conjectured critical point. The method makes the correct prediction for every exactly solved problem, and comparison with numerical results shows that it is very close, but not exact, for many others. We focus primarily on the Archimedean lattices, in which all vertices are equivalent, but this restriction is not crucial. Some results we find are kagome: $p_c=0.524430...$, $(3,12^2): p_c=0.740423...$, $(3^3,4^2): p_c=0.419615...$, $(3,4,6,4):p_c=0.524821...$, $(4,8^2):p_c=0.676835...$, $(3^2,4,3,4)$: $p_c=0.414120...$ . The results are generally within $10^{-5}$ of numerical estimates. For the inhomogeneous checkerboard and bowtie lattices, errors in the formulas (if they are not exact) are less than $10^{-6}$.
The Social Percolation model recently proposed by Solomon et al. is studied on the Ising correlated inhomogeneous network. The dynamics in this is studied so as to understand the role of correlations in the social structure. Thus the possible role of the structural social connectivity is examined.
We present some exact results on bond percolation. We derive a relation that specifies the consequences for bond percolation quantities of replacing each bond of a lattice $Λ$ by $\ell$ bonds connecting the same adjacent vertices, thereby yielding the lattice $Λ_\ell$. This relation is used to calculate the bond percolation threshold on $Λ_\ell$. We show that this bond inflation leaves the universality class of the percolation transition invariant on a lattice of dimensionality $d \ge 2$ but changes it on a one-dimensional lattice and quasi-one-dimensional infinite-length strips. We also prese…
Recent research on percolation has led to the construction of an infinite class of lattices for which the percolation thresholds can be determined exactly. We discuss the mathematical basis for the solutions of bond percolation models, and, in particular, attempt to address some misconceptions that might arise from the seminal articles by Ziff and Scullard. As one consequence, we show that there exist infinitely many real numbers $a \in [0,1]$ for which there are infinitely many lattices that have bond percolation threshold equal to $a$.
Percolation theory has been largely used in the study of structural properties of complex networks such as the robustness, with remarkable results. Nevertheless, a purely topological description is not sufficient for a correct characterization of networks behaviour in relation with physical flows and spreading phenomena taking place on them. The functionality of real networks also depends on the ability of the nodes and the edges in bearing and handling loads of flows, energy, information and other physical quantities. We propose to study these properties introducing a process of inhomogeneous…
We present a general method for predicting bond percolation thresholds and critical surfaces for a broad class of two-dimensional periodic lattices, reproducing many known exact results and providing excellent approximations for several unsolved lattices. For the checkerboard and inhomogeneous bow-tie lattices, the method yields predictions that agree with numerical measurements to more than six figures, and are possibly exact.
We obtain the exact solution of the bond-percolation thresholds with inhomogenous probabilities on the square lattice. Our method is based on the duality analysis with real-space renormalization, which is a profound technique invented in the spin-glass theory. Our formulation is a more straightforward way compared to the very recent study on the same problem [R. M. Ziff, et. al., J. Phys. A: Math. Theor. 45 (2012) 494005]. The resultant generic formulas from our derivation can give several estimations for the bond-percolation thresholds on other lattices rather than the square lattice.
To address some physical properties of percolating systems it can be useful to know the degree distributions in finite clusters along with their size distribution. Here we show that to achieve this aim for classical bond percolation one can use the $q \to 1$ limit of suitably modified q-state Potts model. We consider a version of such model with the additional complex variables and show that its partition function gives generating function for the size and degree distribution in this limit. We derive this distribution analytically for bond percolation on Bethe lattice and complete graph. The p…
A calculation of site-bond percolation thresholds in many lattices in two to five dimensions is presented. The line of threshold values has been parametrized in the literature, but we show here that there are strong deviations from the known approximate equations. We propose an alternative parametrization that lies much closer to the numerical values
The bond-percolation properties of the Hanoi networks are analyzed with the renormalization group. Unlike scale-free networks, they are meant to provide an analytically tractable interpolation between finite dimensional, lattice-based models and their mean-field limits. In percolation, the hierarchical small-world bonds in the Hanoi networks impose a new form of order by uniting otherwise disconnected, local clusters. This "patchy" order results in merely a finite probability to obtain a spanning cluster for certain ranges of the bond probability, unlike the usual 0-1 transition found on ordin…
We study bond percolation on the simple cubic (SC) lattice with various combinations of first, second, third, and fourth nearest-neighbors by Monte Carlo simulation. Using a single-cluster growth algorithm, we find precise values of the bond thresholds. Correlations between percolation thresholds and lattice properties are discussed, and our results show that the percolation thresholds of these and other three-dimensional lattices decrease monotonically with the coordination number $z$ quite accurately according to a power law $p_{c} \sim z^{-a}$, with exponent $a = 1.111$. However, for large …
We study bond percolation of $N$ non-interacting Gaussian polymers of $\ell$ segments on a 2D square lattice of size $L$ with reflecting boundaries. Through simulations, we find the fraction of configurations displaying {\em no} connected cluster which span from one edge to the opposite edge. From this fraction, we define a critical segment density $ρ_{c}^L(\ell)$ and the associated critical fraction of occupied bonds $p_{c}^L(\ell)$, so that they can be identified as the percolation threshold in the $L \to \infty$ limit. Whereas $p_{c}^L(\ell)$ is found to decrease monotonically with $\ell$ f…
An analytical approach to calculating bond percolation thresholds, sizes of $k$-cores, and sizes of giant connected components on structured random networks with non-zero clustering is presented. The networks are generated using a generalization of Trapman's [P. Trapman, Theor. Pop. Biol. {\bf 71}, 160 (2007)] model of cliques embedded in tree-like random graphs. The resulting networks have arbitrary degree distributions and tunable degree-dependent clustering. The effect of clustering on the bond percolation thresholds for networks of this type is examined and contrasted with some recent resu…
High-density (HD) percolation describes the percolation over specific $κ$ -clusters, which are the compact sets of sites each connected to $κ$ nearest filled sites at least. It takes place in the classical patterns of independently distributed sites or bonds in which the ordinary percolation transition also exsists. Hence, the study of series of $κ$ -type percolations amounts to the description of structure of classical clusters for which $κ$ -clusters constitute $κ$ -cores nested one into another. Such data are needed for description of a number of physical, biological information and other p…
We study bond percolation on several four-dimensional (4D) lattices, including the simple (hyper) cubic (SC), the SC with combinations of nearest neighbors and second nearest neighbors (SC-NN+2NN), the body-centered cubic (BCC), and the face-centered cubic (FCC) lattices, using an efficient single-cluster growth algorithm. For the SC lattice, we find $p_c = 0.1601312(2)$, which confirms previous results (based on other methods), and find a new value $p_c=0.035827(1)$ for the SC-NN+2NN lattice, which was not studied previously for bond percolation. For the 4D BCC and FCC lattices, we obtain $p_…
The question of how clustering (non-zero density of triangles) in networks affects their bond percolation threshold has important applications in a variety of disciplines. Recent advances in modelling highly-clustered networks are employed here to analytically study the bond percolation threshold. In comparison to the threshold in an unclustered network with the same degree distribution and correlation structure, the presence of triangles in these model networks is shown to lead to a larger bond percolation threshold (i.e. clustering \emph{increases} the epidemic threshold or \emph{decreases} …
The growth of two-dimensional lattice bond percolation clusters through a cooperative Achlioptas-type of process, where the choice of which bond to occupy next depends upon the masses of the clusters it connects, is shown to go through an explosive, first-order kinetic phase transition with a sharp jump in the mass of the largest cluster as the number of bonds is increased. The critical behavior of this growth model is shown to be of a different universality class than standard percolation.
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 (Berezinskii-Kosterlitz-Thouless) geometric order, occurs in the phase diagram, in addition to the ordinary (compact) percolating phase and the non-percolating phase. It is found that no connection exists between, on the one hand, the onset of this geometric BKT behavior and, on the other hand, the onsets of the highly clustered small-world character of the network and of …
We study percolation on small-world networks, which has been proposed as a simple model of the propagation of disease. The occupation probabilities of sites and bonds correspond to the susceptibility of individuals to the disease and the transmissibility of the disease respectively. We give an exact solution of the model for both site and bond percolation, including the position of the percolation transition at which epidemic behavior sets in, the values of the two critical exponents governing this transition, and the mean and variance of the distribution of cluster sizes (disease outbreaks) b…
We give accurate estimates for the bond percolation critical probabilities on seven Archimedean lattices, for which the critical probabilities are unknown, using an algorithm of Newman and Ziff.
To establish the bond-site duality of explosive percolations in 2 dimension, the site and bond explosive percolation models are carefully defined on a square lattice. By studying the cluster distribution function and the behavior of the second largest cluster, it is shown that the duality in which the transition is discontinuous exists for the pairs of the site model and the corresponding bond model which relatively enhances the intra-bond occupation. In contrast the intra-bond-suppressed models which have no corresponding site models undergo the continuous transition and satisfy the normal sc…
A method to treat a N-component percolation model as effective one component model is presented by introducing a scaled control variable $p_{+}$. In Monte Carlo simulations on $16^{3}$, $32^{3}$, $64^{3}$ and $128^{3}$ simple cubic lattices the percolation threshold in terms of $p_{+}$ is determined for N=2. Phase transitions are reported in two limits for the bond existence probabilities $p_{=}$ and $p_{\neq}$. In the same limits, empirical formulas for the percolation threshold $p_{+}^{c}$ as function of one component-concentration, $f_{b}$, are proposed. In the limit $p_{=} = 0$ a new site …
We present high statistics simulations for 2-d percolation clusters in the "bus bar" geometry at the critical point, for site and for bond percolation. We measured their backbone sizes and electrical conductivities. For all sets of measurements we find large corrections to scaling, most of which do not seem to be described by single powers. Using single power terms for the corrections to scaling of the backbone masses, we would obtain fractal dimensions which are different for site and bond percolation, while the correct result is $D_b = 1.6432(8)$ for both. For the conductivity, the correctio…
We study bond percolation on a one-parameter family of hierarchical small-world network, and find a meta-transition between the inverted BKT transition and the abrupt transition driven by changing the network topology. It is found that the order parameter is continuous and fractal exponent is discontinuous in the inverted BKT transition, and oppositely, the former is discontinuous and the latter is continuous in the abrupt transition. The gaps of the order parameter and fractal exponent in each transition go to vanish as approaching the meta-transition point. This point corresponds to a margin…
We consider the statistical properties of arrival times and balls on first-passage percolation (FPP) $2D$ square lattices with strong disorder in the link-times. A previous work showed a crossover in the weak disorder regime, between Gaussian and Kardar-Parisi-Zhang (KPZ) universality, with the crossover length decreasing as the noise amplitude grows. On the other hand, this work presents a very different behavior in the strong-disorder regime. A new crossover length appears below which the model is described by bond-percolation universality class. This characteristic length scale grows with t…
We collect together results for bond percolation on various lattices from two to fourteen dimensions which, in the limit of large dimension $d$ or number of neighbors $z$, smoothly approach a randomly diluted Erdős-Rényi graph. We include new results on bond diluted hyper-sphere packs in up to nine dimensions, which show the mean coordination, excess kurtosis and skewness evolving smoothly with dimension towards the Erdős-Rényi limit.
We introduce a cluster growth process that provides a clear connection between equilibrium statistical mechanics and an explosive percolation model similar to the one recently proposed by Achlioptas et al. [Science 323, 1453 (2009)]. We show that the following two ingredients are essential for obtaining an abrupt (first-order) transition in the fraction of the system occupied by the largest cluster: (i) the size of all growing clusters should be kept approximately the same, and (ii) the inclusion of merging bonds (i.e., bonds connecting vertices in different clusters) should dominate with resp…
We have investigated both site and bond percolation on two dimensional lattice under the random rule and the product rule respectively. With the random rule, sites or bonds are added randomly into the lattice. From two candidates picked randomly, the site or bond with the smaller size product of two connected clusters is added when the product rule is taken. Not only the size of the largest cluster but also its size jump are studied to characterize the universality class of percolation. The finite-size scaling forms of giant cluster size and size jump are proposed and used to determine the cri…
We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation probability from zero to one in an amount of time which scales linearly with the size of the system. We demonstrate our algorithm by using it to investigate a number of issues in percolation theory, including the position of the percolation transition for site percolation on the square lattice, the stretched exponential behavior of spanning probabilities away from t…
Analytical results are derived for the bond percolation threshold and the size of the giant connected component in a class of random networks with non-zero clustering. The network's degree distribution and clustering spectrum may be prescribed, and theoretical results match well to numerical simulations on both synthetic and real-world networks.
A new position-space renormalization group approach is investigated for bond directed percolation in two dimensions. The threshold value for the bond occupation probabilities is found to be $p_c=0.6443$. Correlation length exponents on time (parallel) and space (transverse) directions are found to be $ν_\parallel=1.719$ and $ν_\perp=1.076$, respectively, which are in very good agreement with the best known series expansion results.
In this work we apply a highly efficient Monte Carlo algorithm recently proposed by Newman and Ziff to treat percolation problems. The site and bond percolation are studied on a number of lattices in two and three dimensions. Quite good results for the wrapping probabilities, correlation length critical exponent and critical concentration are obtained for the square, simple cubic, HCP and hexagonal lattices by using relatively small systems. We also confirm the universal aspect of the wrapping probabilities regarding site and bond dilution.
A transfer-matrix simulation scheme for the three-dimensional (d=3) bond percolation is presented. Our scheme is based on Novotny's transfer-matrix formalism, which enables us to consider arbitrary (integral) number of sites N constituting a unit of the transfer-matrix slice even for d=3. Such an arbitrariness allows us to perform systematic finite-size-scaling analysis of the criticality at the percolation threshold. Diagonalizing the transfer matrix for N =4,5,...,10, we obtain an estimate for the correlation-length critical exponent nu = 0.81(5).
Extended-range percolation on various regular lattices, including all eleven Archimedean lattices in two dimensions, and the simple cubic (SC), body-centered cubic (BCC), and face-centered cubic (FCC) lattices in three dimensions, is investigated. In two dimensions, correlations between coordination number $z$ and site thresholds $p_c$ for Archimedean lattices up to 10th nearest neighbors (NN) are seen by plotting $z$ versus $1/p_{c}$ and $z$ versus $-1/\ln(1-p_c)$, using the data of d'Iribarne et al. [J. Phys. A 32:2611, 1999] and others. The results show that all the plots overlap on a line …
For a certain class of two-dimensional lattices, lattice-dual pairs are shown to have the same bond percolation critical exponents. A computational proof is given for the martini lattice and its dual to illustrate the method. The result is generalized to a class of lattices that allows the equality of bond percolation critical exponents for lattice-dual pairs to be concluded without performing the computations. The proof uses the substitution method, which involves stochastic ordering of probability measures on partially ordered sets. As a consequence, there is an infinite collection of infini…
We introduce a bond percolation procedure on a $D$-dimensional lattice where two neighbouring sites are connected by $N$ channels, each operated by valves at both ends. Out of a total of $N$, randomly chosen $n$ valves are open at every site. A bond is said to connect two sites if there is at least one channel between them, which has open valves at both ends. We show analytically that in all spatial dimensions, this system undergoes a discontinuous percolation transition in the $N\to \infty$ limit when $γ=\frac{\ln n}{\ln N}$ crosses a threshold. It must be emphasized that, in contrast to the …
In a recent letter, Buhot proposes that entropy driven phase-separation in hard-core binary mixtures is directly related to a bond-percolation transition. However, at least for binary hard-sphere mixtures, calculations based on an accurate approximation to g_{ll}(r) demonstrate that n_b varies widely along the phase-boundaries calculated directly by simulations, implying that bond-percolation is unrelated to the phase-separation in these systems.
For certain hierarchical structures, one can study the percolation problem using the renormalization-group method in a very precise way. We show that the idea can be also applied to two-dimensional planar lattices by regarding them as hierarchical structures. Either a lower bound or an exact critical probability can be obtained with this method and the correlation-length critical exponent is approximately estimated as $ν\approx 1$.
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 hypercubic lattices with neighborhoods up to 9th nearest neighbors are studied to high precision by means of Monte-Carlo simulations based upon a single-cluster growth algorithm. For site percolation, an asymptotic analysis confirms the predicted behavior $zp_c \sim 16 η_c = 2.086$ for large $z$, and finite-size corrections are accounted for by forms $p_c \sim 16 η_c…
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…
When conducting bonds are occupied randomly in a two-dimensional square lattice, the conductivity of the system increases continuously as the density of those conducting bonds exceeds the percolation threshold. Such a behavior is well known in percolation theory; however, the conductivity behavior has not been studied yet when the percolation transition is discontinuous. Here we investigate the conductivity behavior through a discontinuous percolation model evolving under a suppressive external bias. Using effective medium theory, we analytically calculate the conductivity behavior as a functi…
Generally, the threshold of percolation in complex networks depends on the underlying structural characterization. However, what topological property plays a predominant role is still unknown, despite the speculation of some authors that degree distribution is a key ingredient. The purpose of this paper is to show that power-law degree distribution itself is not sufficient to characterize the threshold of bond percolation in scale-free networks. To achieve this goal, we first propose a family of scale-free networks with the same degree sequence and obtain by analytical or numerical means sever…
We present exact calculations of the average number of connected clusters per site, $<k>$, as a function of bond occupation probability $p$, for the bond percolation problem on infinite-length strips of finite width $L_y$, of the square, triangular, honeycomb, and kagomé lattices $Λ$ with various boundary conditions. These are used to study the approach of $<k>$, for a given $p$ and $Λ$, to its value on the two-dimensional lattice as the strip width increases. We investigate the singularities of $<k>$ in the complex $p$ plane and their influence on the radii of convergence of the Taylor series…
We investigate bond- and site-percolation models on several two-dimensional lattices numerically, by means of transfer-matrix calculations and Monte Carlo simulations. The lattices include the square, triangular, honeycomb kagome and diced lattices with nearest-neighbor bonds, and the square lattice with nearest- and next-nearest-neighbor bonds. Results are presented for the bond-percolation thresholds of the kagome and diced lattices, and the site-percolation thresholds of the square, honeycomb and diced lattices. We also include the bond- and site-percolation thresholds for the square lattic…
We simulate the bond and site percolation models on a simple-cubic lattice with linear sizes up to L=512, and estimate the percolation thresholds to be $p_c ({\rm bond})=0.248\,811\,82(10)$ and $p_c ({\rm site})=0.311\,607\,7(2)$. By performing extensive simulations at these estimated critical points, we then estimate the critical exponents $1/ν=1.141\,0(15)$, $β/ν=0.477\,05(15)$, the leading correction exponent $y_i =-1.2(2)$, and the shortest-path exponent $d_{\rm min}=1.375\,6(3)$. Various universal amplitudes are also obtained, including wrapping probabilities, ratios associated with the c…
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…
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)^{-γ}$…
We study roughening interfaces with a constant slope that become self organized critical by a rule that is similar to that of invasion percolation. The transient and critical dynamical exponents show Galilean invariance. The activity along the interface exhibits non-trivial power law correlations in both space and time. The probability distribution of the activity pattern follows an algebraic relation.
We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing effective computation of both universal and modelspecific percolation quantities in the case when both random processes are Poisson processes. The algorithm extends percolation algorithm by Newman and Ziff (M.E.J. Newman and R.M. Ziff, Phys Rev E, 64(1):016706, 2001) to handle inhomogeneous lattices. In particular, we use the proposed method to compute critical ex…
We study the SIR ("susceptible, infected, removed/recovered") model on directed graphs with heterogeneous transmission probabilities within the message-passing approximation. We characterize the percolation transition, predict cluster size distributions and suggest vaccination strategies. All predictions are compared to numerical simulations on real networks. The percolation threshold which we predict is a rigorous lower bound to the threshold on real networks. For large, locally tree-like networks, our predictions agree very well with the numerical data.
In this article, we revisit random site and bond percolation in square lattice focusing primarily on the behavior of entropy and order parameter. In the case of traditional site percolation, we find that both the quantities are zero at $p=0$ revealing that the system is in the perfectly ordered and in the disordered state at the same time. Moreover, we find that entropy with $1-p$, which is the equivalent counterpart of temperature, first increases and then decreases again but we know that entropy with temperature cannot decrease. However, bond percolation does not suffer from either of these …
Percolation models with multiple percolating clusters have attracted much attention in recent years. Here we use Monte Carlo simulations to study bond percolation on $L_{1}\times L_{2}$ planar random lattices, duals of random lattices, and square lattices with free and periodic boundary conditions, in vertical and horizontal directions, respectively, and with various aspect ratio $L_{1}/L_{2}$. We calculate the probability for the appearance of $n$ percolating clusters, $W_{n},$ the percolating probabilities, $P$, the average fraction of lattice bonds (sites) in the percolating clusters, $<c^{…
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 transformations that include a phase transition in the connectivity, and in some special cases, multiple phase transitions. Here we establish a generic analytic theory that describes how structure and sizes of all connected components in the network are affected by simple and colour-dependant bond percolations. This theory predicts all locations where the phase trans…
We analyze the connectivity of an $M$-layer network over a common set of nodes that are active only in a fraction of the layers. Each layer is assumed to be a subgraph (of an underlying connectivity graph $G$) induced by each node being active in any given layer with probability $q$. The $M$-layer network is formed by aggregating the edges over all $M$ layers. We show that when $q$ exceeds a threshold $q_c(M)$, a giant connected component appears in the $M$-layer network---thereby enabling far-away users to connect using `bridge' nodes that are active in multiple network layers---even though t…
The Susceptible-Infected-Recovered (SIR) model is studied in multilayer networks with arbitrary number of links across the layers. By following the mapping to bond percolation we give the analytical expression for the epidemic threshold and the fraction of the infected individuals in arbitrary number of layers. These results provide an exact prediction of the epidemic threshold for infinite locally tree-like multilayer networks, and an lower bound of the epidemic threshold for more general multilayer networks. The case of a multilayer network formed by two interconnected networks is specifical…
