DOE OSTI · 1778027
Postprocessing techniques for gradient percolation predictions on the square lattice
Abstract
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, due to skewness in the distribution of occupation probabilities visited the average does not converge monotonically to the true percolation threshold. Furthermore, we identify several alternative metrics which do exhibit monotonic (albeit not linear) convergence and document their observed convergence rates.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Tencer, John, Forsberg, Kelsey Meeks. 2021-01-15. Postprocessing techniques for gradient percolation predictions on the square lattice. https://doi.org/10.1103/physreve.103.012115. https://searchnasa.com/record/osti%3A1778027/postprocessing-techniques-for-gradient-percolation-predictions-on-the-square-lattice
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.