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 $z$, the threshold must approach the Bethe lattice result $p_c = 1/(z-1)$. Fitting our data and data for lattices with additional nearest neighbors, we find $p_c(z-1)=1+1.224 z^{-1/2}$.
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$.
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.
By means of Monte Carlo simulations, we study long-range site percolation on square and simple cubic lattices with various combinations of nearest neighbors, up to the eighth neighbors for the square lattice and the ninth neighbors for the simple cubic lattice. We find precise thresholds for 23 systems using a single-cluster growth algorithm. Site percolation on lattices with compact neighborhoods can be mapped to problems of lattice percolation of extended shapes, such as disks and spheres, and the thresholds can be related to the continuum thresholds $η_c$ for objects of those shapes. This m…
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 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…
The results of investigations of main characteristics of a one-dimensional percolation theory (percolation threshold, critical exponents of correlation radius and specific heat, and free energy) are presented for the problem of bonds and sites. For the first time it is shown that for a finite-size system the stability condition is fulfilled while the scaling hypothesis is inacceptable for one-dimensional bond problem.
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…
It has been suggested that ac conduction in extremely disordered solids occurs on the critical percolation cluster. In this note, we argue that in fact the transport process takes place on the bond invasion percolation cluster (BIPC). The structure of the BIPC is universal independent of the conductances of the bonds, which explains why the rescaled ac conductivity is a universal function of the rescaled frequency. It also explains why the effective-medium approximation provides quantitatively accurate predictions for the effective conductivity.
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…
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.
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 …
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…
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 percolation model is proposed to explain the structural phase transitions found in Li$_{1-x}$H$_x$IO$_3$ mixed crystals as a function of the concentration parameter $x$. The percolation thresholds are obtained from Monte Carlo simulations on the specific lattices occupied by lithium atoms and hydrogen bonds. The theoretical results strongly suggest that percolating lithium vacancies and hydrogen bonds are indeed responsible for the solid solution observed in the experimental range $0.22 < x < 0.36$.
The ground-state of an infinite-range Potts glass-type model with +/- J bonds and unrestricted number of states is used to investigate coalition formation. As a function of the q probability of +J bonds in the system it is found that the r relative size of the largest cluster (a cluster being the group of elements in the same state) shows a percolation like behavior. By a simple renormalization approach and several optimization methods we investigate the r(q) curves for finite systems sizes. Non-trivial consequences for social percolation problems are discussed.
Here we show how the recent exact determination of the bond percolation threshold for the martini lattice can be used to provide approximations to the unsolved kagomé and (3,12^2) lattices. We present two different methods, one of which provides an approximation to the inhomogeneous kagomé and (3,12^2) bond problems, and the other gives estimates of $p_c$ for the homogeneous kagomé (0.5244088...) and (3,12^2) (0.7404212...) problems that respectively agree with numerical results to five and six significant figures.
The hull-gradient method is used to determine the critical threshold for bond percolation on the two-dimensional Kagome lattice (and its dual, the dice lattice). For this system, the hull walk is represented as a self-avoiding trail, or mirror-model trajectory, on the (3,4,6,4)-Archimedean tiling lattice. The result pc = 0.524 405 3(3) (one standard deviation of error) is not consistent with the previously conjectured values.
The two-dimensional antiferromagnetic S=1/2 Heisenberg model with random bond dilution is studied using quantum Monte Carlo simulation at the percolation threshold (50% of the bonds removed). Finite-size scaling of the staggered structure factor averaged over the largest connected clusters of sites on L*L lattices shows that long-range order exists within the percolating fractal clusters in the thermodynamic limit. This implies that the order-disorder transition driven by bond-dilution occurs exactly at the percolation threshold and that the exponents are classical. This result should apply al…
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…
The Harris-Aharony criterion for a statistical model predicts, that if a specific heat exponent $α\ge 0$, then this model does not exhibit self-averaging. In two-dimensional percolation model the index $α=-{1/2}$. It means that, in accordance with the Harris-Aharony criterion, the model can exhibit self-averaging properties. We study numerically the relative variances $R_{M}$ and $R_χ$ for the probability $M$ of a site belongin to the "infinite" (maximum) cluster and the mean finite cluster size $χ$. It was shown, that two-dimensional site-bound percolation on the square lattice, where the bon…
Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety of solved problems. Any graph that can be decomposed into a certain arrangement of triangles, which we call self-dual, gives a class of lattices whose percolation thresholds can be found exactly by a recently introduced triangle-triangle transformation. We use this method to generalize Wierman's solution of the bow-tie lattice to yield several new solutions…
We estimate the critical thresholds of bond and site percolation on nonplanar, effectively two-dimensional graphs with chimera like topology. The building blocks of these graphs are complete and symmetric bipartite subgraphs of size $2n$, referred to as $K_{n,n}$ graphs. For the numerical simulations we use an efficient union-find based algorithm and employ a finite-size scaling analysis to obtain the critical properties for both bond and site percolation. We report the respective percolation thresholds for different sizes of the bipartite subgraph and verify that the associated universality c…
I construct a two-dimensional lattice on which the inhomogeneous site percolation threshold is exactly calculable and use this result to find two more lattices on which the site thresholds can be determined. The primary lattice studied here, the ``martini lattice'', is a hexagonal lattice with every second site transformed into a triangle. The site threshold of this lattice is found to be $0.764826...$, while the others have $0.618034...$ and $1/\sqrt{2}$. This last solution suggests a possible approach to establishing the bound for the hexagonal site threshold, $p_c<1/\sqrt{2}$. To derive the…
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…
We apply generalisations of the Swendson-Wang and Wolff cluster algorithms, which are based on the construction of Fortuin-Kasteleyn clusters, to the three-dimensional $\pm 1$ random-bond Ising model. The behaviour of the model is determined by the temperature $T$ and the concentration $p$ of negative (anti-ferromagnetic) bonds. The ground state is ferromagnetic for $0 \le p<p_c$, and a spin glass for $p_c < p \le 0.5$ where $p_c \simeq 0.222$. We investigate the percolation transition of the Fortuin-Kasteleyn clusters as function of temperature. Except for $p=0$ the Fortuin-Kasteleyn percolat…
We investigate Laplacians on supercritical bond-percolation graphs with different boundary conditions at cluster borders. The integrated density of states of the Dirichlet Laplacian is found to exhibit a Lifshits tail at the lower spectral edge, while that of the Neumann Laplacian shows a van Hove asymptotics, which results from the percolating cluster. At the upper spectral edge, the behaviour is reversed.
We study the effect of positive correlations on the critical threshold of site and bond percolation in a square lattice with d = 2. We propose two algorithms for generating dependent lattices with minimal correlation length and non-negative n-point correlations whose critical behavior is then compared with that of independent lattices. For site percolation, we show numerically that the introduction of this specific form of positive correlation results in a lower percolation threshold, i.e., higher connectivity. For bond percolation, the opposite is observed. In this case, however, we show that…
Most of the investigations to date on tight-binding, quantum percolation models focused on the quantum percolation threshold, i.e., the analogue to the Anderson transition. It appears to occur if roughly 30% of the hopping terms are actually present. Thus, models in the delocalized regime may still be substantially disordered, hence analyzing their transport properties is a nontrivial task which we pursue in the paper at hand. Using a method based on quantum typicality to numerically perform linear response theory we find that conductivity and mean free paths are in good accord with results fr…
In this paper, I compute the inhomogeneous (multi-probability) bond critical surfaces for the (4,6,12) and (3^4,6) lattices using the linearity approximation described in (Scullard and Ziff, J. Stat. Mech. P03021), implemented as a branching process of lattices. I find the estimates for the bond percolation thresholds, p_c(4,6,12)=0.69377849... and p_c(3^4,6)=0.43437077..., compared with Parviainen's numerical results of p_c \approx 0.69373383 and p_c \approx 0.43430621 . These deviations are of the order 10^{-5}, as is standard for this method, although they are outside Parviainen's typical s…
Extensive Monte-Carlo simulations were performed to study bond percolation on the simple cubic (s.c.), face-centered cubic (f.c.c.), and body-centered cubic (b.c.c.) lattices, using an epidemic kind of approach. These simulations provide very precise values of the critical thresholds for each of the lattices: pc(s.c.) = 0.248 812 6(5), pc(f.c.c.) = 0.120 163 5(10), and pc(b.c.c.) = 0.180 287 5(10). For p close to pc, the results follow the expected finite-size and scaling behavior, with values for the Fisher exponent $tau$ (2.189(2)), the finite-size correction exponent $omega$ (0.64(2)), and …
We study bond percolations on hierarchical scale-free networks with the open bond probability of the shortcuts $\tilde{p}$ and that of the ordinary bonds $p$. The system has a critical phase in which the percolating probability $P$ takes an intermediate value $0<P<1$. Using generating function approach, we calculate the fractal exponent $ψ$ of the root clusters to show that $ψ$ varies continuously with $\tilde{p}$ in the critical phase. We confirm numerically that the distribution $n_s$ of cluster size $s$ in the critical phase obeys a power law $n_s \propto s^{-τ}$, where $τ$ satisfies the sc…
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^ψ$ and the mean number of clusters with size $s$ per node follows a power function $n_s \propto s^{-τ}$ in the whole range of open bond probability $p$. The exponent $τ$ and the fractal exponent $ψ$ are also derived as a function of $p$ and the degree exponent $γ$, and are found to satisfy the scaling relation $τ=1+ψ^{-1}$. Numerical results with several network sizes are quite well fitted by a finite size scaling for a wide range of $p$ and $γ$,…
Quantum $k$-core percolation is the study of quantum transport on $k$-core percolation clusters where each occupied bond must have at least $k$ occupied neighboring bonds. As the bond occupation probability, $p$, is increased from zero to unity, the system undergoes a transition from an insulating phase to a metallic phase. When the lengthscale for the disorder, $l_d$, is much greater than the coherence length, $l_c$, earlier analytical calculations of quantum conduction on the Bethe lattice demonstrate that for $k=3$ the metal-insulator transition (MIT) is discontinuous, suggesting a new univ…
We report on the exact treatment of a random-matrix representation of bond percolation model on a square lattice in two dimensions with occupation probability $p$. The percolation problem is mapped onto a random complex matrix composed of two random real-valued matrices of elements $+1$ and $-1$ with probability $p$ and $1-p$, respectively. We find that the onset of percolation transition can be detected by the emergence of power-law divergences due to the coalescence of the first two extreme eigenvalues in the thermodynamic limit. We develop a universal finite-size scaling law that fully char…
Bond-percolation graphs are random subgraphs of the d-dimensional integer lattice generated by a standard bond-percolation process. The associated graph Laplacians, subject to Dirichlet or Neumann conditions at cluster boundaries, represent bounded, self-adjoint, ergodic random operators with off-diagonal disorder. They possess almost surely the non-random spectrum [0,4d] and a self-averaging integrated density of states. The integrated density of states is shown to exhibit Lifshits tails at both spectral edges in the non-percolating phase. While the characteristic exponent of the Lifshits tai…
Percolation on a one-dimensional lattice and fractals such as the Sierpinski gasket is typically considered to be trivial because they percolate only at full bond density. By dressing up such lattices with small-world bonds, a novel percolation transition with explosive cluster growth can emerge at a nontrivial critical point. There, the usual order parameter, describing the probability of any node to be part of the largest cluster, jumps instantly to a finite value. Here, we provide a simple example of this transition in form of a small-world network consisting of a one-dimensional lattice co…
Suggested by Scullard's recent star-triangle relation for bond correlated systems, we propose a general "cell/dual-cell" transformation, which allows in principle an infinite variety of lattices with exact percolation thresholds to be generated. We directly verify Scullard's new site percolation thresholds, and derive the bond thresholds for his "martini" lattice (pc = 1/sqrt(2)) and the "A" lattice (pc = 0.625457..., solution to p^5 - 4 p^4 + 3 p^3 + 2 p^2 - 1 = 0). We also present a precise Monte-Carlo test the site threshold for the "A" lattice.
We develop a theory of pulse conduction in percolation type of materials such as noncrystalline semiconductors and nano-metal compounds. For short voltage pulses, the corresponding electric currents are inversely proportional to the pulse length and exhibit significant nonohmicity due to strong local fields in resistive regions of the percolation bonds. These fields can trigger local switching events incrementally changing bond resistances in response to pulse trains. Our prediction opens a venue to a class of multi-value nonvolatile memory implementable with a variety of materials.
