On parameter identifiability in network-based epidemic models
Istv\'an Zolt\'an Kiss, P\'eter L. Simon

TL;DR
This paper investigates the challenge of parameter identifiability in network-based epidemic models, showing that most parameters are weakly identifiable and multiple solutions can fit the data.
Contribution
It formalizes the identifiability problem in network epidemic models and characterizes conditions under which parameters cannot be uniquely determined.
Findings
Parameters are generally weakly identifiable in complex models.
Multiple parameter solutions can produce similar epidemic outcomes.
Analytical expressions help understand the identifiability landscape.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCOVID-19 epidemiological studies · Complex Network Analysis Techniques · Mathematical and Theoretical Epidemiology and Ecology Models
