Open AccessHow fast is the linear chain trick? A rigorous analysis in the context of behavioral epidemiology
Author(s) -
Alessia Andò,
Dimitri Breda,
Giulia Gava
Publication year - 2020
Publication title -
mathematical biosciences and engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.451
H-Index - 45
eISSN - 1551-0018
pISSN - 1547-1063
DOI - 10.3934/mbe.2020273
Subject(s) - computer science , mathematics , context (archaeology) , erlang distribution , eigenvalues and eigenvectors , fading , chain (unit) , linear system , computation , linear model , calculus (dental) , mathematical optimization , algorithm , statistics , exponential distribution , machine learning , medicine , paleontology , physics , astronomy , biology , mathematical analysis , decoding methods , dentistry , quantum mechanics
A prototype SIR model with vaccination at birth is analyzed in terms of the stability of its endemic equilibrium. The information available on the disease influences the parents' decision on whether vaccinate or not. This information is modeled with a delay according to the Erlang distribution. The latter includes the degenerate case of fading memory as well as the limiting case of concentrated memory. The linear chain trick is the essential tool used to investigate the general case. Besides its novel analysis and that of the concentrated case, it is showed that through the linear chain trick a distributed delay approaches a discrete delay at a linear rate. A rigorous proof is given in terms of the eigenvalues of the associated linearized problems and extension to general models is also provided. The work is completed with several computations and relevant experimental results.