Open AccessAbout the algorithm for calculating the final probabilities
Author(s) -
A. V. Mastikhin,
A. A. Mastikhina
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1392/1/012016
Subject(s) - mathematics , countable set , markov process , markov chain , boundary (topology) , algorithm , generating function , exponential function , trajectory , discrete mathematics , mathematical analysis , statistics , physics , astronomy
We consider a Markov process with continuous time and a countable number of states, known as the (general) Bartlett–Mac-Kendrick epidemic. Kolmogorov’s equation for the exponential (double) generating function of the final probabilities is a hyperbolic partial differential equation. Its solution requires the calculation of the final probabilities for trajectories specifying one of the boundary conditions. It is shown that the desired trajectory is described as the Dick paths, enumerated by Catalan numbers. For arbitrary trajectories of the final probabilities of the general epidemic process, a calculation algorithm based on the contex-free grammar is proposed. The enumerative problem is solved.