Scholarlink

<p>We study the deterministic Susceptible-Infected-Susceptible (SIS) epidemic model on weighted graphs. van Mieghem et al. have shown that it is possible to learn an estimated network from a finite time sample of the trajectories of the dynamics that in turn can give an accurate prediction beyond the sample time range, even though the estimated network might be qualitatively far from the ground truth. We give a mathematically rigorous derivation for this phenomenon, notably that for large networks, prediction of the epidemic curves is robust, while reconstructing the underlying network is ill-conditioned. Furthermore, we also provide an explicit formula for the underlying network when reconstruction is possible. At the heart of the explanation, we rely on Szemerédi’s weak regularity lemma.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Why is it easier to predict the epidemic curve than to reconstruct the underlying contact network?

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年5月2日

查看全文
  • Dániel Keliger,
  • Illés Horváth

摘要

We study the deterministic Susceptible-Infected-Susceptible (SIS) epidemic model on weighted graphs. van Mieghem et al. have shown that it is possible to learn an estimated network from a finite time sample of the trajectories of the dynamics that in turn can give an accurate prediction beyond the sample time range, even though the estimated network might be qualitatively far from the ground truth. We give a mathematically rigorous derivation for this phenomenon, notably that for large networks, prediction of the epidemic curves is robust, while reconstructing the underlying network is ill-conditioned. Furthermore, we also provide an explicit formula for the underlying network when reconstruction is possible. At the heart of the explanation, we rely on Szemerédi’s weak regularity lemma.