By studying its subgraphs, it is argued that the lower critical percolation threshold of the enhanced binary tree (EBT) is bounded as $p_{c1} < 0.355059$, while the upper threshold is bounded both from above and below by 1/2 according to renormalization-group arguments. We also review a correlation analysis in an earlier work, which claimed a significantly higher estimate of $p_{c2}$ than 1/2, to show that this analysis in fact gives a consistent result with this bound. Our result confirms that the duality relation between critical thresholds does not hold exactly for the EBT and its dual, possibly due to the lack of transitivity.
In this paper we compute the square lattice random sites percolation thresholds in case when sites from the 4th and the 5th coordination shells are included for neighbourhood. The obtained results support earlier claims, that (a) the coordination number and the space dimension are insufficient for building universal formulae for percolation thresholds and (b) that percolation threshold may not decrease monotonically with lattice site coordination number.
Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount importance. For two dimensional lattice graphs, we use the universal scaling form of the cluster size distributions to derive a relation between the mean Euler characteristic of the critical percolation patterns and the threshold density $p_c$. From this relation, we deduce a simple rule to estimate $p_c$, which is remarkably accurate. We present some evidence that…
This is supplementary material for the article arxiv:0708.3250. We provide an alternative introduction of the mean Euler Characteristic, additional examples and the percolation thresholds for 2-uniform lattices.
Connections are found between the two-component percolation problem and the conductor/insulator percolation problem. These produce relations between critical exponents, and suggest formulae connecting the conductivity exponents in different dimensions. Values for the critical exponents are obtained from calculations on the incipient infinite cluster in two and three dimensions.
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.
We improve our previous results for the percolation thresholds of isotropically oriented rods in three dimensional boxes. We prove again the applicability of the excluded volume rule in the slender-rod limit (radius/length -> 0). Other limits for the rod sizes are discussed and important finite-size effects are revealed.
Using Monte Carlo simulations on different system sizes we determine with high precision the critical thresholds of two families of directed percolation models on a square lattice. The thresholds decrease exponentially with the degree of connectivity. We conjecture that $p_{c}$ decays exactly as the inverse of the coodination number.
We use invasion percolation to compute highly-accurate numerical values for bond and site percolation thresholds p_c on the hypercubic lattice Z^d for d = 4,,,,,13. We also compute the Fisher exponent tau governing the cluster size distribution at criticality. Our results support the claim that the mean-field value tau = 5/2 holds for d >= 6, with logarithmic corrections to power-law scaling at d=6.
In this paper we consider statistical estimates of threshold and strength of percolation clusters on square lattices. The percolation threshold $p_c$ and the strength of percolation clusters $P_\infty$ for a square lattice with $(1, d)$-neighborhood depends not only on the lattice dimension, but also on the Minkowski exponent $d$. To estimate the strength of percolation clusters $P_\infty$ proposed a new method of averaging the relative frequencies of the target subset of lattice sites. The implementation of this method is based on the SPSL package, released under GNU GPL-3 using the free prog…
The site and bond percolation problems are conventionally studied on (hyper)cubic lattices, which afford straightforward numerical treatments. The recent implementation of efficient simulation algorithms for high-dimensional systems now also facilitates the study of $D_n$ root lattices in $n$ dimension as well as $E_8$-related dense packing lattices. Here, we consider the percolation problem on $D_n$ for $n=3$ to $13$ and on $E_8$ relatives for $n=6$ to 9. Precise estimates for both site and bond percolation thresholds obtained from invasion percolation simulations are compared with dimensiona…
The following article deals with the critical value p_c of the three-dimensional bootstrap percolation. We will check the behavior of p_c for different lengths of the lattice and additionally we will scale p_c in the limit of an infinite lattice.
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…
The probability distribution of percolation thresholds in finite lattices were first believed to follow a normal Gaussian behaviour. With increasing computer power and more efficient simulational techniques, this belief turned to a stretched exponential behaviour, instead. Here, based on a further improvement of Monte Carlo data, we show evidences that this question is not yet answered at all.
Using a recently introduced algorithm for simulating percolation in microcanonical (fixed-occupancy) samples, we study the convergence with increasing system size of a number of estimates for the percolation threshold for an open system with a square boundary, specifically for site percolation on a square lattice. We show that the convergence of the so-called "average-probability" estimate is described by a non-trivial correction-to-scaling exponent as predicted previously, and measure the value of this exponent to be 0.90(2). For the "median" and "cell-to-cell" estimates of the percolation th…
The effect of thickness on the width of the percolation threshold in metal-dielectric composite films was examined. The distribution of current intensities through cubic networks of metal and dielectric components was determined using Kirchhoff's equations. From the tail of current distribution, the width of the percolation threshold was defined using Lévy statistics, and determined as a function of the film thickness for a system size 100. In the 2D-3D crossover region, the percolation width decreases as a power-law with a power exponent of $ 0.36\pm 0.01$.
In a recent article, Galam and Mauger proposed an invariant for site and bond percolation thresholds, based on known values for twenty lattices (Eur. Phys. J. B 1 (1998) 255-258). Here we give a larger list of values for more than forty lattices in two to six dimensions. In this list are new results for fcc, bcc, and diamond lattices in 4, 5, and 6 dimensions. The list contains examples of lattices with equal site percolation thresholds, but different bond percolation thresholds. These and other examples show that there are deviations from the proposed invariant of up to 12% in two dimensions,…
We discuss a classical mistake, made in earlier publications on the stick percolation problem in 3D, for generating the right isotropic configuration of sticks. We explain the observed systematic deviations from the excluded volume rule. New MC simulations considered by us confirm nicely the applicability of the excluded volume theory.
In the present article, numerical simulations have been performed to find the bond and site percolation thresholds on two-dimensional Gabriel graphs (GG) for Poisson point processes. GGs belong to the family of proximity graphs and are discussed, e.g., in context of the construction of backbones for wireless ad-hoc networks. In order to find the critical points, finite-size scaling analyses have been performed for several observables. The critical exponents obtained this way verify that the associated universality class is that of standard $2D$ percolation.
Recently a multifractal object, $Q_{mf}$, was proposed to study percolation properties in a multifractal support. The area and the number of neighbors of the blocks of $Q_{mf}$ show a non-trivial behavior. The value of the probability of occupation at the percolation threshold, $p_{c}$, is a function of $ρ$, a parameter of $Q_{mf}$ which is related to its anisotropy. We investigate the relation between $p_{c}$ and the average number of neighbors of the blocks as well as the anisotropy of $Q_{mf}$.
Porous media are often modelled as systems of overlapping obstacles, which leads to the problem of two percolation thresholds in such systems, one for the porous matrix and the other one for the void space. Here we investigate these percolation thresholds in the model of overlapping squares or cubes of linear size $k>1$ randomly distributed on a regular lattice. We find that the percolation threshold of obstacles is a nonmonotonic function of $k$, whereas the percolation threshold of the void space is well approximated by a function linear in $1/k$. We propose a generalization of the excluded …
Using an inverse of the standard linear congruential random number generator, large randomly occupied lattices can be visited by a random walker without having to determine the occupation status of every lattice site in advance. In seven dimensions, at the percolation threshold with L^7 sites and L < 420, we confirm the expected time-dependence of the end-to-end distance (including the corrections to the asymptotic behavior).
We study continuum percolation of overlapping circular discs of two sizes. We propose a phenomenological scaling equation for the increase in the effective size of the larger discs due to the presence of the smaller discs. The critical percolation threshold as a function of the ratio of sizes of discs, for different values of the relative areal densities of two discs, can be described in terms of a scaling function of only one variable. The recent accurate Monte Carlo estimates of critical threshold by Quintanilla and Ziff [Phys. Rev. E, 76 051115 (2007)] are in very good agreement with the pr…
We calculate the distribution of the size of the percolating cluster on a tree in the subcritical, critical and supercritical phase. We do this by exploiting a mapping between continuum trees and Brownian excursions, and arrive at a diffusion equation with suitable boundary conditions. The exact solution to this equation can be conveniently represented as a characteristic function, from which the following distributions are clearly visible: Gaussian (subcritical), Kolmogorov-Smirnov (critical) and exponential (supercritical). In this way we provide an intuitive explanation for the result repor…
Hyperbolic structures are obtained by tiling a hyperbolic surface with negative Gaussian curvature. These structures generally exhibit two percolation transitions: a system-wide connection can be established at a certain occupation probability $p=p_{c1}$ and there emerges a unique giant cluster at $p_{c2} > p_{c1}$. There have been debates about locating the upper transition point of a prototypical hyperbolic structure called the enhanced binary tree (EBT), which is constructed by adding loops to a binary tree. This work presents its lower bound as $p_{c2} \gtrsim 0.55$ by using phenomenologic…
Using Monte Carlo simulation, we studied the percolation of sticks, i.e. zero-width rods, on a plane paying special attention to the effects of stick alignment and their length dispersity. The stick lengths were distributed in accordance with log-normal distributions, providing a constant mean length with different widths of distribution. Scaling analysis was performed to obtain the percolation thresholds in the thermodynamic limits for all values of the parameters. Greater alignment of the sticks led to increases in the percolation threshold while an increase in length dispersity decreased th…
We investigate the critical phenomena of the degree-ordered percolation (DOP) model on the hierarchical $(u,v)$ flower network. Using the renormalization-group like procedure, we derive the recursion relations for the percolating probability and the percolation order parameter, from which the percolation threshold and the critical exponents are obtained. When $u\neq 1$, the DOP critical behavior turns out to be identical to that of the bond percolation with a shifted nonzero percolation threshold. When $u=1$, the DOP and the bond percolation have the same vanishing percolation threshold but th…
Site percolation in a distorted simple cubic lattice is characterized numerically employing the Newman-Ziff algorithm. Distortion is administered in the lattice by systematically and randomly dislocating its sites from their regular positions. The amount of distortion is tunable by a parameter called the distortion parameter. In this model, two occupied neighboring sites are considered connected only if the distance between them is less than a predefined value called the connection threshold. It is observed that the percolation threshold always increases with distortion if the connection thres…
We determine thresholds $p_c$ for random-site percolation on a triangular lattice for all available neighborhoods containing sites from the first to the fifth coordination zones, including their complex combinations. There are 31 distinct neighbourhoods. The dependence of the value of the percolation thresholds $p_c$ on the coordination number $z$ are tested against various theoretical predictions. The newly proposed single scalar index $ξ=\sum_i z_ir_i^2/i$ (depending on the coordination zone number $i$, the neighbourhood coordination number $z$ and the square-distance $r^2$ to sites in $i$-t…
We study proper lattice animals for bond- and site-percolation on the hypercubic lattice $\mathbb{Z}^d$ to derive asymptotic series of the percolation threshold $p_c$ in $1/d$, The first few terms of these series were computed in the 1970s, but the series have not been extended since then. We add two more terms to the series for $\pcsite$ and one more term to the series for $\pcbond$, using a combination of brute-force enumeration, combinatorial identities and an approach based on Padé approximants, which requires much fewer resources than the classical method. We discuss why it took 40 years …
Percolation for a planar lattice has a single percolation threshold, whereas percolation for a negatively curved lattice displays two separate thresholds. The enhanced binary tree (EBT) can be viewed as a prototype model displaying two separate percolation thresholds. We present an analytic result for the EBT model which gives two critical percolation threshold probabilities, $p_{c1}=1/2\sqrt{13}-3/2$ and $p_{c2}=1/2$, and yields a size-scaling exponent $Φ=\ln [\frac{p(1+p)}{1-p(1-p)}]/\ln 2$. It is inferred that the two threshold values give exact upper limits and that $p_{c1}$ is furthermore…
Threshold-Controlled Geometric Reorganization in 2D Bootstrap Percolation
Beijing Normal University（北京师范大学）；Xi’an University of Science and Technology（西安科技大学）；University of Electronic Science and Technology of China（电子科技大学）；Chinese Academy of Sciences（中国科学院）
Covering a graph or a lattice with non-overlapping dimers is a problem that has received considerable interest in areas such as discrete mathematics, statistical physics, chemistry and materials science. Yet, the problem of percolation on dimer-covered lattices has received little attention. In particular, percolation on lattices that are fully covered by non-overlapping dimers has not evidently been considered. Here, we propose a novel procedure for generating random dimer coverings of a given lattice. We then compute the bond percolation threshold on random and ordered coverings of the squar…
We investigate corrections to scaling induced by irrelevant operators in randomly diluted systems near the percolation threshold. The specific systems that we consider are the random resistor network and a class of continuous spin systems, such as the x-y-model. We focus on a family of least irrelevant operators and determine the corrections to scaling that originate from this family. Our field theoretic analysis carefully takes into account, that irrelevant operators mix under renormalization. It turns out that long standing results on corrections to scaling are respectively incorrect (random…
Recent advances on the glass problem motivate reexamining classical models of percolation. Here, we consider the displacement of an ant in a labyrinth near the percolation threshold on cubic lattices both below and above the upper critical dimension of simple percolation, d_u=6. Using theory and simulations, we consider the scaling regime part, and obtain that both caging and subdiffusion scale logarithmically for d >= d_u. The theoretical derivation considers Bethe lattices with generalized connectivity and a random graph model, and employs a scaling analysis to confirm that logarithmic scali…
We analytically study bond percolation on hyperbolic lattices obtained by tiling a hyperbolic plane with constant negative Gaussian curvature. The quantity of our main concern is $p_{c2}$, the value of occupation probability where a unique unbounded cluster begins to emerge. By applying the substitution method to known bounds of the order-5 pentagonal tiling, we show that $p_{c2} \ge 0.382 508$ for the order-5 square tiling, $p_{c2} \ge 0.472 043$ for its dual, and $p_{c2} \ge 0.275 768$ for the order-5-4 rhombille tiling.
The incipient infinite cluster appearing at the bond percolation threshold can be decomposed into singly-connected ``links'' and multiply-connected ``blobs.'' Here we decompose blobs into objects known in graph theory as 3-blocks. A 3-block is a graph that cannot be separated into disconnected subgraphs by cutting the graph at 2 or fewer vertices. Clusters, blobs, and 3-blocks are special cases of $k$-blocks with $k=1$, 2, and 3, respectively. We study bond percolation clusters at the percolation threshold on 2-dimensional square lattices and 3-dimensional cubic lattices and, using Monte-Carlo…
In a recent paper, we have reported a universal power law for both site and bond percolation thresholds for any lattice of cubic symmetry. Extension to anisotropic lattices is discussed.
We present a site-percolation model based on a modified FCC lattice, as well as an efficient algorithm of inspecting percolation which takes advantage of the Markov stochastic theory, in order to study the percolation threshold of carbon nanotube (CNT) fibers. Our Markov-chain based algorithm carries out the inspection of percolation by performing repeated sparse matrix-vector multiplications, which allows parallelized computation to accelerate the inspection for a given configuration. With this approach, we determine that the site-percolation transition of CNT fibers occurs at p_c =0.1533+-0.…
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$.
The present work introduces an efficient Monte Carlo algorithm for continuum percolation composed of randomly-oriented rectangles. By conducting extensive simulations, we report high precision percolation thresholds for a variety of homogeneous systems with different rectangle aspect ratios. This work verifies and extends the excluded area theory. It is confirmed that percolation thresholds are dominated by the average excluded areas for both homogeneous and heterogeneous rectangle systems (except for some special heterogeneous systems where the rectangle lengths differ too much from one anoth…
Consider the class of k-independent bond, respectively site, percolations with parameter p on an infinite tree T. We derive tight bounds on p for both a.s. percolation and a.s. nonpercolation. The bounds are continuous functions of k and the branching number of T. This extends previous results by Lyons for the independent case (k=0) and by Bollobàs & Balister for 1-independent bond percolations. Central to our argumentation are moment method bounds à la Lyons supplemented by explicit percolation models à la Bollobàs & Balister. An indispensable tool is the minimality and explicit construction …
Monte Carlo simulations are performed to determine the critical percolation threshold for interpenetrating square objects in two dimensions and cubic objects in three dimensions. Simulations are performed for two cases: (i) objects whose edges are aligned parallel to one another and (ii) randomly oriented objects. For squares whose edges are aligned, the critical area fraction at the percolation threshold phi_c=0.6666 +/- 0.0004, while for randomly oriented squares phi_c=0.6254 +/- 0.0002, 6% smaller. For cubes whose edges are aligned, the critical volume fraction at the percolation threshold …
By numerical simulation, we study the classical magnetoresistance of two-dimensional electrons in the presence of weak short range scattering. A critical magnetic field defines the percolation threshold, above which the longitudinal resistance vanishes. Unexpectedely, just below this threshold we find a shrp narrow peak, where the resistance may increase 15 times compared to its zero-field value. By considering the complex topology of the effective potential landscape for the center of the cyclotron circle, we show that this phenomenon is related to infinite equipotential lines, which exists o…
We present a study of site and bond percolation on periodic lattices with 3 nearest neighbors per site. We have considered 3 lattices, with different symmetries, different underlying Bravais lattices, and different degrees of longer-range connections. As expected, we find that the site and bond percolation thresholds in all of the 3-connected lattices studied here are significantly higher than in diamond. Interestingly, thresholds for different lattices are similar to within a few percent, despite the differences between the lattices at scales beyond nearest and next-nearest neighbors.
We perform Monte-Carlo simulations to study the Bernoulli ($p$) bond percolation on the enhanced binary tree which belongs to the class of nonamenable graphs with one end. Our numerical results show that the system has two different percolation thresholds $p_{c1}$ and $p_{c2}$. All the points in the intermediate phase $(p_{c1} < p < p_{c2})$ are critical and there exist infinitely many infinite clusters in the intermediate phase. In this phase the corresponding fractal exponent continuously increases with $p$ from zero to unity.
We consider different methods, that do not rely on numerical simulations of the percolation process, to approximate percolation thresholds in networks. We perform a systematic analysis on synthetic graphs and a collection of 109 real networks to quantify their effectiveness and reliability as prediction tools. Our study reveals that the inverse of the largest eigenvalue of the non-backtracking matrix of the graph often provides a tight lower bound for true percolation threshold. However, in more than 40% of the cases, this indicator is less predictive than the naive expectation value based sol…
Three-dimensional single-component ideal gas systems composed of model homogeneous rigid molecules in various molecular shapes and sizes are simulated by a molecular Monte Carlo simulation technique. We reveal that percolation thresholds of such single-component systems result in, when the molecular volume is fixed, power-law decreasing functions of the radius of gyration (gyradius) of the molecules. The systems with the same parameter set of the molecular volume and radius of gyration, but in different molecular shapes, show the identical value of the percolation threshold. Moreover, we also …
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} …
An universal invariant for site and bond percolation thresholds (p_{cs} and p_{cb} respectively) is proposed. The invariant writes {p_{cs}}^{1/a_s}{p_{cb}}^{-1/a_b}=δ/d where a_s, a_b and δare positive constants,and d the space dimension. It is independent of the coordination number, thus exhibiting a topology invariance at any d.The formula is checked against a large class of percolation problems, including percolation in non-Bravais lattices and in aperiodic lattices as well as rigid percolation. The invariant is satisfied within a relative error of \pm 5% for all the twenty lattices of our …
In this paper we study the properties of the Barabási model of queueing under the hypothesis that the number of tasks is steadily growing in time. We map this model exactly onto an Invasion Percolation dynamics on a Cayley tree. This allows to recover the correct waiting time distribution $P_W(τ)\sim τ^{-3/2}$ at the stationary state (as observed in different realistic data) and also to characterize it as a sequence of causally and geometrically connected bursts of activity. We also find that the approach to stationarity is very slow.
We discuss the nature of the two-stage percolation transition on the enhanced binary tree in order to explain the disagreement in the estimation of the second transition probability between the one in our recent paper (J. Phys. A:Math. Theor. 42 (2009) 145001) and the one in the comment to it from Baek, Minnhagen and Kim. We point out some reasons that the finite size scaling analysis used by them is not proper for the enhanced tree due to its nonamenable nature, which is verified by some numerical results.
In this paper we analyze several anisotropic bootstrap percolation models in three dimensions. We present the order of magnitude for the metastability threshold for a fairly general class of models. In our proofs we use an adaptation of the technique of dimensional reduction. We find that the order of the metastability threshold is generally determined by the "easiest growth direction" in the model. In contrast to the anisotropic bootstrap percolation in two dimensions, in three dimensions the order of the metatstability threshold for anisotropic bootstrap percolation can be equal to that of i…
The universal law for percolation thresholds proposed by Galam and Mauger (GM) is found to apply also to dynamical situations. This law depends solely on two variables, the space dimension d and a coordinance numberq. For regular lattices, q reduces to the usual coordination number while for anisotropic lattices it is an effective coordination number. For dynamical percolation we conjecture that the law is still valid if we use the number q_2 of second nearest neighbors instead of q. This conjecture is checked for the dynamic epidemic model which considers the percolation phenomenon in a mobil…
Theoretical attempts proposed so far to describe ordinary percolation processes on real-world networks rely on the locally tree-like ansatz. Such an approximation, however, holds only to a limited extent, as real graphs are often characterized by high frequencies of short loops. We present here a theoretical framework able to overcome such a limitation for the case of site percolation. Our method is based on a message passing algorithm that discounts redundant paths along triangles in the graph. We systematically test the approach on 98 real-world graphs and on synthetic networks. We find exce…
Lattices that can be represented in a kagome-like form are shown to satisfy a universal percolation criticality condition, expressed as a relation between P_3, the probability that all three vertices in the triangle connect, and P_0, the probability that none connect. A linear approximation for P_3(P_0) is derived and appears to provide a rigorous upper bound for critical thresholds. A numerically determined relation for P_3(P_0) gives thresholds for the kagome, site-bond honeycomb, (3-12^2), and "stack-of-triangle" lattices that compare favorably with numerical results.
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…
It was pointed out by de Arcangelis et al. [Europhys. Lett. 14 (1991), 515] that the correct understanding of the percolation phenomenon of the Fortuin-Kasteleyn cluster in the Edwards-Anderson model is important since a dynamical transition, which is characterized by a parameter called the Hamming distance or damage, and the percolation transition are related to a transition for a signal propagating between spins. We show analytically the percolation thresholds of the Fortuin-Kasteleyn cluster for a Potts gauge glass model, which is an extended model of the Edwards-Anderson model, on random g…
We analytically show the percolation thresholds of the Fortuin-Kasteleyn cluster for the Edwards-Anderson Ising model on random graphs with arbitrary degree distributions. The results on the Nishimori line are shown. We obtain the results for the +-J model, the diluted +-J model, and the Gaussian model, by applying an extension of a criterion for the random graphs with arbitrary degree distributions. The results for the infinite-range $\pm J$ model and the Sherrington-Kirkpatrick model are also shown.
