Postprocessing techniques for gradient percolation predictions on the square lattice.

@article{Tencer2021PostprocessingTF,
  title={Postprocessing techniques for gradient percolation predictions on the square lattice.},
  author={John Tencer and Kelsey Meeks Forsberg},
  journal={Physical review. E},
  year={2021},
  volume={103 1-1},
  pages={
          012115
        }
}
In this work, we revisit the classic problem of site percolation on a regular square lattice. In particular, we investigate the effect of quantization bias errors on percolation threshold predictions for large probability gradients and propose a mitigation strategy. We demonstrate through extensive computational experiments that the assumption of a linear relationship between probability gradient and percolation threshold used in previous investigations is invalid. Moreover, we demonstrate that… 
1 Citations

Percolation in a triangle on a square lattice

Percolation on a plane is usually associated with clusters spanning two opposite sides of a rectangular system. Here we investigate three-leg clusters generated on a square lattice and spanning the

References

SHOWING 1-10 OF 41 REFERENCES

Efficient Monte Carlo algorithm and high-precision results for percolation.

A new Monte Carlo algorithm is presented that is able to calculate quantities such as the cluster size distribution or spanning probability over the entire range of site or bond occupation probabilities from zero to one in a single run which takes an amount of time scaling linearly with the number of sites on the lattice.

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.

Maximum Percolation Time in Two-Dimensional Bootstrap Percolation

It is proved that the maximum time a bootstrap percolation process can take to eventually infect the entire vertex set of the grid is $13n^2/18+O(n)$.

Corrections to finite size scaling in percolation

A 1 = L-expansion for percolation problems is proposed, where L is the lattice finite length. The square lattice with 27 different sizes L = 18; 22;... 1594 is considered. Certain spanning

The efficient determination of the percolation threshold by a frontier-generating walk in a gradient

The frontier in gradient percolation is generated directly by a type of self-avoiding random walk. The existence of the gradient permits one to generate an infinite walk on a computer of finite

Percolation in networks with voids and bottlenecks.

A general method is proposed for predicting the asymptotic percolation threshold of networks with bottlenecks, in the limit that the subnet mesh size goes to zero, consistent with a direct determination based upon the predicted critical corner-connection probability.

Percolation on two- and three-dimensional lattices.

A highly efficient Monte Carlo algorithm recently proposed by Newman and Ziff is applied to treat percolation problems to confirm the universal aspect of the wrapping probabilities regarding site and bond dilution.

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.

Monte Carlo study of the site-percolation model in two and three dimensions.

  • Youjin DengH. Blöte
  • Physics, Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
A Monte Carlo algorithm is introduced that in fact simulates systems with size L(d-1) x infinity, where L specifies the linear system size, and which can be regarded either as an extension of the Hoshen-Kopelman method or as a special case of the transfer-matrix Monte Carlo technique.

Asymmetry in the percolation thresholds of fully penetrable disks with two different radii.

Simulation of continuum gradient percolation of systems of fully penetrable disks of two different radii improves the measurement of thepercolation threshold for disks of equal radius, and improves the difference from symmetry.