ON CALCULATING THE MEAN INFECTED TIME USING A DISCRETE MARKOV EPIDEMIOLOGICAL MODEL WITHOUT TREATMENT

Abstract

Modeling of the spread of viruses is a relevant research field. There are a lot of «continuous» epidemic models based on the use of systems of differential equations. The disadvantage of such models lies in their error in describing the initial stage of virus propagation and in the fact that they ignore the specific features of inter-individual connections. «Discrete» models, in which the time and the number of infected and susceptible nodes are discrete values, provide a more accurate picture of the epidemic process. In this work, we study a discrete Markov model in the case when there is no treatment. This is an important case, since it can be viewed as either an approximation to the initial phase of an epidemic or as a model for epidemics of viruses that are difficult to treat. The first section provides a detailed description of the properties of the Markov model used in this study. In the second section, using Markov approach, we define the mean infected time, i.e. the number of time steps taken to infect all individuals in the population. However, calculating the mean infected time in populations with a large number of individuals (or in networks with a large number of nodes) is computationally difficult problem, so in the third section we propose the corresponding approximate formula for this parameter. This approximation is designed for conditions of low network connectivity and а low probability of virus spread. In the fourth section, to validate our approximate formula, we compare its results against both exact calculations (using the fundamental matrix M) and data from simulation modeling. For the simulations, we developed a custom C++ console application. Our analysis demonstrates that all three methods yield consistent results under the specified conditions, confirming the practical utility of the simpler approximate formula

Authors

References

1. Kermack W. O., McKendrick A. G. A contribution to the mathematical theory of epidemics, Proceedings of the Royal Society of London. Series A, Containing papers of a mathematical and physical character, 1927, Vol. 115, No. 772, pp. 700-721.

2. Persoons R., Van Mieghem P. Finding patient zero in susceptible-infectious-susceptible epidemic pro-cesses, Physical Review E, 2024, Vol. 110, No. 4, pp. 044308.

3. Achterberg M. A., Van Mieghem P. Moment closure approximations of susceptible-infectedsusceptible epidemics on adaptive networks, Physical Review E, 2022, Vol. 106, No. 1, pp. 014308.

4. Notarmuzi D. et al. Critical avalanches of susceptible-infected-susceptible dynamics in finite networks, Physical Review E, 2023, Vol. 107, No. 2, pp. 024310.

5. Abbey H. An examination of the Reed-Frost theory of epidemics, Human biology, 1952, Vol. 24,

No. 3, pp. 201.

6. Fine P.E.M. A commentary on the mechanical analogue to the Reed-Frost epidemic model, American journal of epidemiology, 1977, Vol. 106, No. 2, pp. 87-100.

7. Hoppensteadt F.C. Mathematical methods of population biology. Cambridge University Press, 1982. – No. 4.

8. Cohen F. Computer viruses: theory and experiments, Computers & security, 1987, Vol. 6, No. 1,

pp. 22-35. DOI: 10.1016/0167-4048(87)90122-2.

9. Kephart J.O., White S.R. Directed-graph epidemiological models of computer viruses, Computation: the micro and the macro view, 1992, pp. 71-102.

10. Kephart J.O., White S.R. Measuring and modeling computer virus prevalence, Proceedings 1993 IEEE Computer Society Symposium on Research in Security and Privacy. IEEE, 1993, pp. 2-15. DOI: 10.1109/RISP.1993.287647.

11. Pastor-Satorras R. et al. Epidemic processes in complex networks, Reviews of modern physics, 2015, Vol. 87, No. 3, pp. 925-979.

12. Granger T. et al. Stochastic compartment model with mortality and its application to epidemic spreading in complex networks, Entropy, 2024, Vol. 26, No. 5, pp. 362. DOI: 10.3390/e26050362.

13. Singh P., Gupta A. Generalized SIR (GSIR) epidemic model: An improved framework for the predictive monitoring of COVID-19 pandemic, ISA transactions, 2022, Vol. 124, pp. 31-40.

14. Billings L., Spears W.M., Schwartz I.B. A unified prediction of computer virus spread in connected net-works, Physics Letters A, 2002, Vol. 297, No. 3-4, pp. 261-266.

15. Dalinger YA.M., Babanin D.V., Burkov S.M. Matematicheskie modeli rasprostraneniya virusov v komp'yuternykh setyakh razlichnoy struktury [The mathematical models of the spreading of viruses in computer networks with the diferent structures], Informatika i sistemy upravleniya [Computer science and control systems], 2011, No. 4, pp. 3-11.

16. Bel'chenko A.O., Magazev A.A., Nikiforova A.Yu. Priblizhennaya otsenka srednego chisla zarazhennykh uzlov v markovskoy modeli rasprostraneniya komp'yuternykh virusov [An approximate evaluation of the infected nodes number for a Markov model of viruses spreading], Matematicheskie struktury i mod-elirovanie [Mathematical Structures and Modeling], 2022, No. 1 (61), pp. 92-104.

17. Magazev A.A., Nikiforova A.Yu. Programma dlya otsenki srednego vremeni rasprostraneniya komp'yuternogo virusa v setyakh, assotsiirovannykh so sluchaynymi grafami: svidetel'stvo o registratsii elektronnogo resursa [A program for estimating the average spread time of a computer virus in networks associated with random graphs]. Moscow: FIPS, 2023. Patent RF № 2023614819 from 06.03.2023.

18. Nikiforova A.Yu. Priblizhennaya otsenka usloviy prekrashcheniya epidemii komp'yuternogo virusa v svyaznykh setyakh, assotsiirovannykh so sluchaynymi grafami [An approximate evaluation of the condi-tions for the termination of a computer virus epidemic in connected networks associated with random graphs], Modelirovanie, optimizatsiya i informatsionnye tekhnologii [The scientific journal Modeling, Optimization and Information Technology], 2023, Vol. 11, No. 4 (43). DOI: 10.26102/2310-6018/2023.43.4.034.

19. Magazev A.A., Nikiforova A.Y. On the Applicability of a Markov Virus Spread Model to E-mail Graphs, 2023 Dynamics of Systems, Mechanisms and Machines (Dynamics). IEEE, 2023, pp. 1-4. DOI: 10.26102/2310-6018/2023.43.4.034.

20. Lawler G. F. Introduction to stochastic processes. Chapman and Hall/CRC, 2018, 234 p.

21. Erdos P., Renyi A. On Random Graphs, Publicationes Mathematicae (Debrecen), 1959, Vol. 6,

pp. 290-297.

Скачивания

Published:

2025-11-10

Issue:

Section:

SECTION II. DATA ANALYSIS, MODELING AND CONTROL

Keywords:

Epidemic model, computer virus, Markov chain, random graph, mean infected time

For citation:

А.А. Magazev , А. Y. Nikiforova ON CALCULATING THE MEAN INFECTED TIME USING A DISCRETE MARKOV EPIDEMIOLOGICAL MODEL WITHOUT TREATMENT. IZVESTIYA SFedU. ENGINEERING SCIENCES – 2025. - № 5. – P. 53-63.