Estimates of threshold and strength of percolation clusters on square lattices with (1,π)-neighborhood

Moskalev P.V.
 pdf (327K)  / List of references

In this paper we consider statistical estimates of threshold and strength of percolation clusters on square lattices. The percolation threshold pc and the strength of percolation clusters P∞ for a square lattice with (1,π)-neighborhood depends not only on the lattice dimension, but also on the Minkowski exponent d. To estimate the strength of percolation clusters P∞ proposed a new method of averaging the relative frequencies of the target subset of lattice sites. The implementation of this method is based on the SPSL package, released under GNU GPL-3 using the free programming language R.

Keywords: site percolation, square lattice, non-metric Minkowski distance, Moore neighborhood, percolation threshold, strength of infinite clusters, R programming language, SPSL package
Citation in English: Moskalev P.V. Estimates of threshold and strength of percolation clusters on square lattices with (1,π)-neighborhood // Computer Research and Modeling, 2014, vol. 6, no. 3, pp. 405-414
Citation in English: Moskalev P.V. Estimates of threshold and strength of percolation clusters on square lattices with (1,π)-neighborhood // Computer Research and Modeling, 2014, vol. 6, no. 3, pp. 405-414
DOI: 10.20537/2076-7633-2014-6-3-405-414
URL: http://crm-en.ics.org.ru/journal/article/2155/
Creative Commons License This work is licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License.
Views (last year): 4. Citations: 5 (RSCI).

Indexed in Scopus

Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU

The journal is included in the Russian Science Citation Index

The journal is included in the RSCI

International Interdisciplinary Conference "Mathematics. Computing. Education"

Copyright © 2009–2024 Institute of Computer Science