|
Itogi Nauki i Tekhniki. Sovremennaya Matematika i ee Prilozheniya. Tematicheskie Obzory, 2024, Volume 235, Pages 15–33 DOI: https://doi.org/10.36535/2782-4438-2024-235-15-33
(Mi into1305)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Hierarchical models in discrete percolation theory and Markov branching processes
Yu. P. Virchenko, D. A. Cherkashin Belgorod Shukhov State Technological University
DOI:
https://doi.org/10.36535/2782-4438-2024-235-15-33
Abstract:
A brief introduction to percolation theory is given. Within the framework of the discrete percolation theory on infinite graphs, we develop a method for approximating the percolation probability based on the construction of a sequence of infinite graphs of a special type called the hierarchical graphs. The calculation of the percolation probability for graphs of this type is reduced to the analysis of a suitable Markov branching process with discrete time.
Keywords:
infinite graph, percolation probability, branching random process, supercritical regime, connectedness relation
Citation:
Yu. P. Virchenko, D. A. Cherkashin, “Hierarchical models in discrete percolation theory and Markov branching processes”, Proceedings of the Voronezh international spring mathematical school "Modern methods of the theory of boundary-value problems. Pontryagin readings—XXXV", Voronezh, April 26-30, 2024, Part 1, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 235, VINITI, Moscow, 2024, 15–33
Linking options:
https://www.mathnet.ru/eng/into1305 https://www.mathnet.ru/eng/into/v235/p15
|
|