基于网络的传染病模型中参数的可辨识性
On parameter identifiability in network-based epidemic models
摘要:
数学流行病学中的许多模型都是为了给参数估计和预测提供一个框架而发展起来的。众所周知,参数并不总是唯一可识别的。在本文中,我们考虑基于网络的平均场模型,并探讨了参数可识别性的问题时,观察到的流行病。利用大多数基于网络的平均场模型的分析易处理性,例如,通过引入前导特征值和最终流行规模的显式解析表达式,我们将参数可识别性问题建立为求解一个耦合方程组的解。更确切地说,受观察/测量增长率和最终的流行规模,我们试图确定导致这些测量的参数值。我们特别关注从网络密度中分离出传输速率。为了做到这一点,我们定义强和弱可识别性,我们发现,除了最简单的模型,参数不能唯一确定,也就是说,他们是弱可识别的。这意味着存在多个解决方案(无限测度的流形),这些解决方案会产生接近数据的模型输出。识别,形式化和分析描述这个问题应该导致更好地了解拟合模型的复杂性与许多参数的数据。
英文摘要:
Many models in mathematical epidemiology are developed with the aim to provide a framework for parameter estimation and then prediction. It is well-known that parameters are not always uniquely identifiable. In this paper we consider network-based mean-field models and explore the problem of parameter identifiability when observations about an epidemic are available. Making use of the analytical tractability of most network-based mean-field models, e.g., explicit analytical expressions for leading eigenvalue and final epidemic size, we set up the parameter identifiability problem as finding the solution or solutions of a system of coupled equations. More precisely, subject to observing/measuring growth rate and final epidemic size, we seek to identify parameter values leading to these measurements. We are particularly concerned with disentangling transmission rate from the network density. To do this we define strong and weak identifiability and we find that except for the simplest model, parameters cannot be uniquely determined, that is they are weakly identifiable. This means that there exists multiple solutions (a manifold of infinite measure) which give rise to model output that is close to the data. Identifying, formalising and analytically describing this problem should lead to a better appreciation of the complexity involved in fitting models with many parameters to data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。