Site percolation thresholds on triangular lattice with complex neighborhoods.

@article{Malarz2020SitePT,
  title={Site percolation thresholds on triangular lattice with complex neighborhoods.},
  author={Krzysztof Malarz},
  journal={Chaos},
  year={2020},
  volume={30 12},
  pages={
          123123
        }
}
  • K. Malarz
  • Published 28 June 2020
  • Computer Science, Physics
  • Chaos
We determine thresholds pc for random site percolation on a triangular lattice for neighborhoods containing nearest (NN), next-nearest (2NN), next-next-nearest (3NN), next-next-next-nearest (4NN), and next-next-next-next-nearest (5NN) neighbors, and their combinations forming regular hexagons (3NN+2NN+NN, 5NN+4NN+NN, 5NN+4NN+3NN+2NN, and 5NN+4NN+3NN+2NN+NN). We use a fast Monte Carlo algorithm, by Newman and Ziff [Phys. Rev. E 64, 016706 (2001)], for obtaining the dependence of the largest… 

Figures and Tables from this paper

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 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

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

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)

Site and bond percolation on four-dimensional simple hypercubic lattices with extended neighborhoods

The asymptotic behavior of the percolation threshold p c and its dependence upon coordination number z is investigated for both site and bond percolation on four-dimensional lattices with compact

References

SHOWING 1-10 OF 40 REFERENCES

Simple cubic random-site percolation thresholds for neighborhoods containing fourth-nearest neighbors.

  • K. Malarz
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2015
In this paper, random-site percolation thresholds for a simple cubic (SC) lattice with site neighborhoods containing next-next-next-nearest neighbors (4NN) are evaluated with Monte Carlo simulations.

Square-lattice site percolation at increasing ranges of neighbor bonds.

  • K. MalarzS. Galam
  • Physics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
The existing Galam-Mauger universal formula for percolation thresholds does not reproduce the data showing dimension and coordination number are not sufficient to build a universal law which extends to complex lattices.

Precise bond percolation thresholds on several four-dimensional lattices

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),

Restoring site percolation on damaged square lattices.

  • S. GalamK. Malarz
  • Physics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
Restoring site percolation on a damaged square lattice with the nearest neighbor (N2) is investigated using two different strategies, each of which adds new longer range links to N2 but only for a fraction of the remaining non-destroyed sites.

Efficient space virtualisation for Hoshen-Kopelman algorithm

The proposed algorithm is applied for computation of random-site percolation thresholds for four dimensional simple cubic lattice with sites' neighbourhoods containing next-next-nearest neighbours (3NN).

Square lattice site percolation thresholds for complex neighbourhoods

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

Fast Monte Carlo algorithm for site or bond percolation.

  • M. NewmanR. Ziff
  • Physics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
An efficient algorithm is described that can measure an observable quantity in a percolation system for all values of the site or bond occupation probability from zero to one in an amount of time that scales linearly with the size of the system.

Explosive site percolation and finite-size hysteresis.

Evidence that explosive site percolation surprisingly may belong to a different universality class than bond percolations on lattices, providing that the transitions are continuous and obey the conventional finite size scaling forms is found.

Crystal statistics with long-range forces: I. The equivalent neighbour model

The aim of this series of papers is to help bridge the gap in our knowledge of the properties of the Ising and Heisenberg models between very short-range forces corresponding to nearest-neighbour