Critical polynomials in the nonplanar and continuum percolation models

Percolation thresholds of disks with random nonoverlapping patches on four regular two-dimensional lattices

In percolation of patchy disks on lattices, each site is occupied by a disk, and neighboring disks are regarded as connected when their patches contact. Clusters of connected disks become larger as the patchy coverage of each disk χ increases. At the percolation threshold χ_{c}, an incipient cluster begins to span the whole lattice. For systems of disks with n symmetric patches on Archimedean lattices, a recent work [Wang et al., Phys. Rev. E 105, 034118 (2022)2470-004510.1103/PhysRevE.105.034118] found symmetric properties of χ_{c}(n), which are due to the coupling of the patches' symmetry and the lattice geometry. How does χ_{c} behave with increasing n if the patches are randomly distributed on the disks? We consider two typical random distributions of the patches, i.e., the equilibrium distribution and a distribution from random sequential adsorption. Combining Monte Carlo simulations and the critical polynomial method, we numerically determine χ_{c} for 106 models of different n on the square, honeycomb, triangular, and kagome lattices. The rules governing χ_{c}(n) are investigated in detail. They are quite different from those for disks with symmetric patches and could be useful for understanding similar systems.

Percolation threshold and electrical conductivity of conductive polymer composites filled with curved fibers in two-dimensional space

Quantifying the influence of fiber curvature on the percolation behavior of flexible conductive fiber and further on the electrical conductivity of conductive polymer composites (CPCs) is crucial for the design of CPCs. This study considers CPCs as a random packing of soft curved discorectangles (CDCRs) in a polymer matrix. The geometry of CDCR is developed, and an inter-CDCR contact detection algorithm is used to generate a random packing structure of CDCRs. The effects of aspect ratio α and bending central angles θ of CDCR on the percolation threshold ϕc of the overlapped CDCR system in a two-dimensional plane are then investigated using the finite-size scaling method. The result reveals that ϕc decreases monotonically as α grows and increases monotonically as θ rises. A shape-independent power law formula, denoted as ϕc = 2.2015 A-0.8172dex is developed to quantify the relationship between the Adex and ϕc. A comparison of our numerical simulations, published data, and predictions verifies the reliability and universality of the fitting model. Subsequently, a resistor network searching algorithm (RNSA) is proposed to construct the random resistor network model (RRNM). A power law model, denoted as is developed to evaluate the effects of the normalized reduced density (η - ηc)/ηc on the effective conductivity σeff of CPC. Comparing our predictions with data from the literature and our simulation verifies the reliability of our RNSA and the fitting model. This paper's methodology and findings may provide a theoretical hint for the CPC's design.

Universal Critical Behavior of Percolation in Orientationally Ordered Janus Particles and Other Anisotropic Systems

We combine percolation theory and Monte Carlo simulation to study in two dimensions the connectivity of an equilibrium lattice model of interacting Janus disks which self-assemble into an orientationally ordered stripe phase at low temperature. As the patch size is increased or the temperature is lowered, clusters of patch-connected disks grow, and a percolating cluster emerges at a threshold. In the stripe phase, the critical clusters extend longer in the direction parallel to the stripes than in the perpendicular direction, and percolation is thus anisotropic. It is found that the critical behavior of percolation in the Janus system is consistent with that of standard isotropic percolation, when an appropriate spatial rescaling is made. The rescaling procedure can be applied to understand other anisotropic systems, such as the percolation of aligned rigid rods and of the q-state Potts model with anisotropic interactions.

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.

Exactly solvable percolation problems

We propose a simple percolation criterion for arbitrary percolation problems. The basic idea is to decompose the system of interest into a hierarchy of neighborhoods, such that the percolation problem can be expressed as a branching process. The criterion provides the exact percolation thresholds for a large number of exactly solved percolation problems, including random graphs, small-world networks, bond percolation on two-dimensional lattices with a triangular hypergraph, and site percolation on two-dimensional lattices with a generalized triangular hypergraph, as well as specific continuum percolation problems. The fact that the range of applicability of the criterion is so large bears the remarkable implication that all the listed problems are effectively treelike. With this in mind, we transfer the exact solutions known from duality to random lattices and site-bond percolation problems and introduce a method to generate simple planar lattices with a prescribed percolation threshold.

Percolation thresholds of randomly rotating patchy particles on Archimedean lattices

We study the percolation of randomly rotating patchy particles on 11 Archimedean lattices in two dimensions. Each vertex of the lattice is occupied by a particle, and in each model the patch size and number are monodisperse. When there are more than one patches on the surface of a particle, they are symmetrically decorated. As the proportion χ of the particle surface covered by the patches increases, the clusters connected by the patches grow and the system percolates at the threshold χ_{c}. We combine Monte Carlo simulations and the critical polynomial method to give precise estimates of χ_{c} for disks with one to six patches and spheres with one to two patches on the 11 lattices. For one-patch particles, we find that the order of χ_{c} values for particles on different lattices is the same as that of threshold values p_{c} for site percolation on these lattices, which implies that χ_{c} for one-patch particles mainly depends on the geometry of lattices. For particles with more patches, symmetry becomes very important in determining χ_{c}. With the estimates of χ_{c} for disks with one to six patches, using analyses related to symmetry, we are able to give precise values of χ_{c} for disks with an arbitrary number of patches on all 11 lattices. The following rules are found for patchy disks on each of these lattices: (1) as the number of patches n increases, values of χ_{c} repeat in a periodic way, with the period n_{0} determined by the symmetry of the lattice; (2) when mod(n,n_{0})=0, the minimum threshold value χ_{min} appears, and the model is equivalent to site percolation with χ_{min}=p_{c}; and (3) disks with mod(n,n_{0})=m and n_{0}-m (m<n_{0}/2) share the same χ_{c} value. The results can be useful references for studying the connectivity of patchy particles on two-dimensional lattices at finite temperatures.

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.

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

By means of extensive Monte Carlo simulation, we study extended-range site percolation on square and simple cubic lattices with various combinations of nearest neighbors up to the eighth nearest neighbors for the square lattice and the ninth nearest 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 of connected sites can be mapped to problems of lattice percolation of extended objects of a given shape, such as disks and spheres, and the thresholds can be related to the continuum thresholds η_{c} for objects of those shapes. This mapping implies zp_{c}∼4η_{c}=4.51235 in two dimensions and zp_{c}∼8η_{c}=2.7351 in three dimensions for large z for circular and spherical neighborhoods, respectively, where z is the coordination number. Fitting our data for compact neighborhoods to the form p_{c}=c/(z+b) we find good agreement with this prediction, c=2^{d}η_{c}, with the constant b representing a finite-z correction term. We also examined results from other studies using this fitting formula. A good fit of the large but finite-z behavior can also be made using the formula p_{c}=1-exp(-2^{d}η_{c}/z), a generalization of a formula of Koza, Kondrat, and Suszcayński [J. Stat. Mech.: Theor. Exp. (2014) P110051742-546810.1088/1742-5468/2014/11/P11005]. We also study power-law fits which are applicable for the range of values of z considered here.