Estimates of critical probabilities of percolation on finite square grids

Authors

  • Maksim M. Vaskouski Belarusian State University, 4 Niezaliezhnasci Avenue, Minsk 220030, Belarus
  • Anna O. Zadorozhnyuk EPAM Systems, 1 Akademika Kuprevicha Street, 1 building, Minsk 220141, Belarus
  • Anna D. Dosova EPAM Systems, 1 Akademika Kuprevicha Street, 1 building, Minsk 220141, Belarus

Keywords:

percolation, critical probability, grid

Abstract

In this paper, we investigate the problem of determining the critical probabilities of percolation for finite square grids. Basing on the Harris – Kesten theorem on critical probability pc(Z2) in the infinite square grid, we prove that the exact threshold of exponential decay in the infinite square grid is equal to 1/2. With the help of the evaluated value of pg(Z2) we show that the critical probabilities of percolation on finite square grids are arbitrarily close to 1/2 when the size of a grid is large enough.

Author Biographies

  • Maksim M. Vaskouski, Belarusian State University, 4 Niezaliezhnasci Avenue, Minsk 220030, Belarus

    doctor of science (physics and mathematics), full professor; head of the department of higher mathematics, faculty of applied mathematics and computer science

     

  • Anna O. Zadorozhnyuk, EPAM Systems, 1 Akademika Kuprevicha Street, 1 building, Minsk 220141, Belarus

    assistant at the department of higher mathematics, faculty of applied mathematics and computer science

     

  • Anna D. Dosova, EPAM Systems, 1 Akademika Kuprevicha Street, 1 building, Minsk 220141, Belarus

    system analyst

     

References

  1. Broadbent SR, Hammersley JM. Percolation processes. I. Crystals and mazes. Mathematical Proceedings of the Cambridge Philosophical Society. 1957;53(3):629–641. DOI: 10.1017/S0305004100032680.
  2. Sykes MF, Essam JW. Exact critical percolation probabilities for site and bond problems in two dimensions. Journal of Mathematical Physics. 1964;5(8):1117–1127. DOI: 10.1063/1.1704215.
  3. Harris TE. A lower bound for the critical probability in a certain percolation process. Mathematical Proceedings of the Cambridge Philosophical Society. 1960;56(1):13–20. DOI: 10.1017/S0305004100034241.
  4. Kesten H. The critical probability of bond percolation on the square lattice equals 1/2. Communications in Mathematical Physics. 1980;74(1):41–59. DOI: 10.1007/BF01197577.
  5. Malon C, Pak I. Percolation on finite Cayley graphs. Combinatorics, Probability and Computing. 2006;15(4):571–588. DOI: 10.1017/S0963548305007406.
  6. Grimmet G. Percolation. 2nd edition. Berlin: Springer-Verlag; 1999. XIII, 447 p. (Chern SS, Eckmann B, de la Harpe P, Hironaka H, Hirzebruch F, Hitchin N, et al., editors. Grundlehren der mathematischen Wissenschaften; volume 321). DOI: 10.1007/978-3-662-03981-6.
  7. Borgs C, Chayes JT, Kesten H, Spencer J. The birth of the infinite cluster: finite-size scaling in percolation. Communications in Mathematical Physics. 2001;224(1):153–204. DOI: 10.1007/s002200100521.
  8. Rusilko TV. The G-network as a stochastic data network model. Journal of the Belarusian State University. Mathematics and Informatics. 2023;2:45–54.
  9. Zadorozhnyuk AO. Monotonicity of random walks’ states on finite grids. Journal of the Belarusian State University. Mathematics and Informatics. 2022;1:38–45. Russian. DOI: 10.33581/2520-6508-2022-1-38-45.

Downloads

Published

2023-12-13

How to Cite

[1]
Vaskouski, M.M. et al. 2023. Estimates of critical probabilities of percolation on finite square grids. Journal of the Belarusian State University. Mathematics and Informatics. 3 (Dec. 2023), 92–97.