Site percolation on square and simple cubic lattices with extended neighborhoods and their continuum limit

Effect of shape anisotropy on percolation of aligned and overlapping objects on lattices

We investigate the percolation transition of aligned, overlapping, anisotropic shapes on lattices. Using the recently proposed lattice version of excluded volume theory, we show that shape-anisotropy leads to some intriguing consequences regarding the percolation behavior of anisotropic shapes. We consider a prototypical anisotropic shape-rectangle-on a square lattice and show that, for rectangles of width unity (sticks), the percolation threshold is a monotonically decreasing function of the stick length, whereas, for rectangles of width greater than two, it is a monotonically increasing function. Interestingly, for rectangles of width two, the percolation threshold is independent of its length. We show that this independence of threshold on the length of a side holds for d-dimensional hypercubiods as well as for specific integer values for the lengths of the remaining sides. The limiting case of the length of the rectangles going to infinity shows that the limiting threshold value is finite and depends upon the width of the rectangle. This "continuum" limit with the lattice spacing tending to zero only along a subset of the possible directions in d dimensions results in a "semicontinuum" percolation system. We show that similar results hold for other anisotropic shapes and lattices in different dimensions. The critical properties of the aligned and overlapping rectangles are evaluated using Monte Carlo simulations. We find that the threshold values given by the lattice-excluded volume theory are in good agreement with the simulation results, especially for larger rectangles. We verify the isotropy of the percolation threshold and also compare our results with models where rectangles of mixed orientation are allowed. Our simulation results show that alignment increases the percolation threshold. The calculation of critical exponents places the model in the standard percolation universality class. Our results show that shape anisotropy of the aligned, overlapping percolating units has a marked influence on the percolation properties, especially when a subset of the dimensions of the percolation units is made to diverge.

Universality of random-site percolation thresholds for two-dimensional complex noncompact neighborhoods

The phenomenon of percolation is one of the core topics in statistical mechanics. It allows one to study the phase transition known in real physical systems only in a purely geometrical way. In this paper, we determine thresholds p_{c} for random-site percolation in triangular and honeycomb lattices for all available neighborhoods containing sites from the sixth coordination zone. The results obtained (together with the percolation thresholds gathered from the literature also for other complex neighborhoods and also for a square lattice) show the power-law dependence p_{c}∝(ζ/K)^{-γ} with γ=0.526(11), 0.5439(63), and 0.5932(47), for a honeycomb, square, and triangular lattice, respectively, and p_{c}∝ζ^{-γ} with γ=0.5546(67) independently on the underlying lattice. The index ζ=∑_{i}z_{i}r_{i} stands for an average coordination number weighted by distance, that is, depending on the coordination zone number i, the neighborhood coordination number z_{i}, and the distance r_{i} to sites in the ith coordination zone from the central site. The number K indicates lattice connectivity, that is, K=3, 4, and 6 for the honeycomb, square, and triangular lattice, respectively.

Extended-range percolation in complex networks

Classical percolation theory underlies many processes of information transfer along the links of a network. In these standard situations, the requirement for two nodes to be able to communicate is the presence of at least one uninterrupted path of nodes between them. In a variety of more recent data transmission protocols, such as the communication of noisy data via error-correcting repeaters, both in classical and quantum networks, the requirement of an uninterrupted path is too strict: two nodes may be able to communicate even if all paths between them have interruptions or gaps consisting of nodes that may corrupt the message. In such a case a different approach is needed. We develop the theoretical framework for extended-range percolation in networks, describing the fundamental connectivity properties relevant to such models of information transfer. We obtain exact results, for any range R, for infinite random uncorrelated networks and we provide a message-passing formulation that works well in sparse real-world networks. The interplay of the extended range and heterogeneity leads to novel critical behavior in scale-free networks.

Site percolation in distorted square and simple cubic lattices with flexible number of neighbors

This paper exhibits a Monte Carlo study on site percolation using the Newmann-Ziff algorithm in distorted square and simple cubic lattices where each site is allowed to be directly linked with any other site if the Euclidean separation between the pair is at most a certain distance d, called the connection threshold. Distorted lattices are formed from regular lattices by a random but controlled dislocation of the sites with the help of a parameter α, called the distortion parameter. The distinctive feature of this study is the relaxation of the restriction of forming bonds with only the nearest neighbors. Owing to this flexibility and the intricate interplay between the two parameters α and d, the site percolation threshold may either increase or decrease with distortion. The dependence of the percolation threshold on the average degree of a site has been explored to show that the obtained results are consistent with those on percolation in regular lattices with an extended neighborhood and continuum percolation.

Possible new phase transition in the 3D Ising model associated with boundary percolation

In the ordered phase of the 3D Ising model, minority spin clusters are surrounded by a boundary of dual plaquettes. As the temperature is raised, these spin clusters become more numerous, and it is found that eventually their boundaries undergo a percolation transition when about 13% of spins are minority. Boundary percolation differs from the more commonly studied site and link percolation, although it is related to an unusual type of site percolation that includes next to nearest neighbor relationships. Because the Ising model can be reformulated in terms of the domain boundaries alone, there is reason to believe boundary percolation should be relevant here. A symmetry-breaking order parameter is found in the dual theory, the 3D gauge Ising model. It is seen to undergo a phase transition at a coupling close to that predicted by duality from the boundary percolation. This transition lies in the disordered phase of the gauge theory and has the nature of a spin-glass transition. Its critical exponentν∼1.3is seen to match the finite-size shift exponent of the percolation transition further cementing their connection. This predicts a very weak specific heat singularity with exponentα∼-1.9. The third energy cumulant fits well to the expected non-infinite critical behavior in a manner consistent with both the predicted exponent and critical point, indicating a true thermal phase transition. Unlike random boundary percolation, the Ising boundary percolation has two differentνexponents, one associated with largest-cluster scaling and the other with finite-size transition-point shift. This suggests there may be two different correlation lengths present.

Percolation in a simple cubic lattice with distortion

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 threshold is equal to or greater than the lattice constant of the regular lattice. On the other hand, if the connection threshold is less than the lattice constant, the percolation threshold first decreases and then increases steadily as distortion is increased. It is shown that the variation of the percolation threshold can be well explained by the change in the fraction of occupied bonds with distortion. The values of the relevant critical exponents of the transition strongly indicate that percolation in regular and distorted simple cubic lattices belong to the same universality class. It is also demonstrated that this model is intrinsically distinct from the site-bond percolation model.

Random site percolation on honeycomb lattices with complex neighborhoods

We present a rough estimation-up to four significant digits, based on the scaling hypothesis and the probability of belonging to the largest cluster vs the occupation probability-of the critical occupation probabilities for the random site percolation problem on a honeycomb lattice with complex neighborhoods containing sites up to the fifth coordination zone. There are 31 such neighborhoods with a radius ranging from one to three and containing 3-24 sites. For two-dimensional regular lattices with compact extended-range neighborhoods, in the limit of the large number z of sites in the neighborhoods, the site percolation thresholds _p follow the dependency _p ∝ 1 / z, as recently shown by Xun et al. [Phys. Rev. E 105, 024105 (2022)]. On the contrary, non-compact neighborhoods (with holes) destroy this dependence due to the degeneracy of the percolation threshold (several values of _p corresponding to the same number z of sites in the neighborhoods). An example of a single-value index ζ = ∑ i _{z r}-where _z and _r are the number of sites and radius of the ith coordination zone, respectively-characterizing the neighborhood and allowing avoiding the above-mentioned degeneracy is presented. The percolation threshold obtained follows the inverse square root dependence _p ∝ 1 / ζ. The functions boundaries() (written in C) for basic neighborhoods (for the unique coordination zone) for the Newman and Ziff algorithm [Phys. Rev. E 64, 016706 (2001)] are also presented. The latter may be useful for computer physicists dealing with solid-state physics and interdisciplinary statistical physics applications, where the honeycomb lattice is the underlying network topology.

Cumulative merging percolation: A long-range percolation process in networks

Percolation on networks is a common framework to model a wide range of processes, from cascading failures to epidemic spreading. Standard percolation assumes short-range interactions, implying that nodes can merge into clusters only if they are nearest neighbors. Cumulative merging percolation (CMP) is a percolation process that assumes long-range interactions such that nodes can merge into clusters even if they are topologically distant. Hence, in CMP clusters do not coincide with the topologically connected components of the network. Previous work has shown that a specific formulation of CMP features peculiar mechanisms for the formation of the giant cluster and allows one to model different network dynamics such as recurrent epidemic processes. Here we develop a more general formulation of CMP in terms of the functional form of the cluster interaction range, showing an even richer phase transition scenario with competition of different mechanisms resulting in crossover phenomena. Our analytic predictions are confirmed by numerical simulations.

Site and bond percolation thresholds on regular lattices with compact extended-range neighborhoods in two and three dimensions

Extended-range percolation on various regular lattices, including all 11 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)JPHAC50305-447010.1088/0305-4470/32/14/002] and others. The results show that all the plots overlap on a line with a slope consistent with the theoretically predicted asymptotic value of zp_{c}∼4η_{c}=4.51235, where η_{c} is the continuum threshold for disks. In three dimensions, precise site and bond thresholds for bcc and fcc lattices with 2nd and 3rd NN, and bond thresholds for the sc lattice with up to the 13th NN, are obtained by Monte Carlo simulations, using an efficient single-cluster growth method. For site percolation, the values of thresholds for different types of lattices with compact neighborhoods also collapse together, and linear fitting is consistent with the predicted value of zp_{c}∼8η_{c}=2.7351, where η_{c} is the continuum threshold for spheres. For bond percolation, Bethe-lattice behavior p_{c}=1/(z-1) is expected to hold for large z, and the finite-z correction is confirmed to satisfy zp_{c}-1∼a_{1}z^{-x}, with x=2/3 for three dimensions as predicted by Frei and Perkins [Electron. J. Probab. 21, 56 (2016)1083-648910.1214/16-EJP6] and by Xu et al. [Phys. Rev. E 103, 022127 (2021)2470-004510.1103/PhysRevE.103.022127]. Our analysis indicates that for compact neighborhoods, the asymptotic behavior of zp_{c} has universal properties, depending only on the dimension of the system and whether site or bond percolation but not on the type of lattice.

Percolation thresholds on a triangular lattice for neighborhoods containing sites up to the fifth coordination zone

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 neighborhoods. The dependence of the value of the percolation thresholds p_{c} on the coordination number z are tested against various theoretical predictions. The proposed single scalar index ξ=∑_{i}z_{i}r_{i}^{2}/i (depending on the coordination zone number i, the neighborhood coordination number z, and the square distance r^{2} to sites in ith coordination zone from the central site) allows one to differentiate among various neighborhoods and relate p_{c} to ξ. The thresholds roughly follow a power law p_{c}∝ξ^{-γ} with γ≈0.710(19).

Critical polynomials in the nonplanar and continuum percolation models

Exact or precise thresholds have been intensively studied since the introduction of the percolation model. Recently, the critical polynomial P_{B}(p,L) was introduced for planar-lattice percolation models, where p is the occupation probability and L is the linear system size. The solution of P_{B}=0 can reproduce all known exact thresholds and leads to unprecedented estimates for thresholds of unsolved planar-lattice models. In two dimensions, assuming the universality of P_{B}, we use it to study a nonplanar lattice model, i.e., the equivalent-neighbor lattice bond percolation, and the continuum percolation of identical penetrable disks, by Monte Carlo simulations and finite-size scaling analysis. It is found that, in comparison with other quantities, P_{B} suffers much less from finite-size corrections. As a result, we obtain a series of high-precision thresholds p_{c}(z) as a function of coordination number z for equivalent-neighbor percolation with z up to O(10^{5}) and clearly confirm the asymptotic behavior zp_{c}-1∼1/sqrt[z] for z→∞. For the continuum percolation model, we surprisingly observe that the finite-size correction in P_{B} is unobservable within uncertainty O(10^{-5}) as long as L≥3. The estimated threshold number density of disks is ρ_{c}=1.43632505(10), slightly below the most recent result ρ_{c}=1.43632545(8) of Mertens and Moore obtained by other means. Our work suggests that the critical polynomial method can be a powerful tool for studying nonplanar and continuum systems in statistical mechanics.