Random site percolation on honeycomb lattices with complex neighborhoods.

  title={Random site percolation on honeycomb lattices with complex neighborhoods.},
  author={Krzysztof Malarz},
  volume={32 8},
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… 

Figures and Tables from this paper



Site percolation threshold for honeycomb and square lattices

A new method of estimating the critical percolation threshold is proposed, based on Stauffer's cluster number scaling hypothesis and the universality with respect to lattice structure of the

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

By means of extensive Monte Carlo simulation, 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 nearestNeighborhoods are found using a single-cluster growth algorithm.

Percolation transitions in two dimensions.

The amplitude of the power-law correction associated with X_{t2}=4 is found to be dependent on the orientation of the lattice with respect to the cylindrical geometry of the finite systems.

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)

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

Exact percolation probabilities for a square lattice: site percolation on a plane, cylinder, and torus

We have found analytical expressions (polynomials) of the percolation probability for site percolation on a square lattice of size L × L sites when considering a plane (the crossing probability in a

Critical polynomials in the nonplanar and continuum percolation models.

It is found that the critical polynomial method can be a powerful tool for studying nonplanar and continuum systems in statistical mechanics and suffers much less from finite-size corrections than other quantities.

Site percolation thresholds on triangular lattice with complex neighborhoods.

A fast Monte Carlo algorithm is used for determining thresholds pc for random site percolation on a triangular lattice for neighborhoods containing nearest (NN), next-nearest (2NN, next-next-Nearest (3NN), and next-Next-next -next-ne nearest (4NN) neighbors, and their combinations forming regular hexagons.

Percolation of overlapping squares or cubes on a lattice

This work proposes a generalization of the excluded volume approximation to discrete systems and uses it to investigate the transition between continuous and discrete percolation, finding a remarkable agreement between the theory and numerical results.

High-precision percolation thresholds and Potts-model critical manifolds from graph polynomials

The critical curves of the q-state Potts model can be determined exactly for regular two-dimensional lattices G that are of the three-terminal type. This comprises the square, triangular, hexagonal