# Two golden times in two-step contagion models

**Authors:** Wonjun Choi, Deokjae Lee, J. Kert\'esz, Byungnam Kahng

arXiv: 1706.08968 · 2018-07-25

## TL;DR

This paper identifies two types of golden times in two-step contagion models, scaling differently with system size, and explores their universality and dependence on initial conditions and model specifics.

## Contribution

It uncovers two distinct scaling behaviors of the golden time in two-step contagion models and analyzes their dependence on initial conditions and network size.

## Key findings

- Two types of golden times scale as O(N^{1/3}) and O(N^{4})
- The 1/3 exponent is universal across models with discontinuous transitions
- The 4 exponents are model-dependent and close to 1/4

## Abstract

The two-step contagion model is a simple toy model for understanding pandemic outbreaks that occur in the real world. The model takes into account that a susceptible person either gets immediately infected or weakened when getting into contact with an infectious one. As the number of weakened people increases, they eventually can become infected in a short time period and a pandemic outbreak occurs. The time required to reach such a pandemic outbreak allows for intervention and is often called golden time. Understanding the size-dependence of the golden time is useful for controlling pandemic outbreak. Here we find that there exist two types of golden times in the two-step contagion model, which scale as $O(N^{1/3})$ and $O(N^{\zeta})$ with the system size $N$ on Erd\H{o}s-R\'enyi networks, where the measured $\zeta$ is slightly larger than $1/4$. They are distinguished by the initial number of infected nodes, $o(N)$ and $O(N)$, respectively. While the exponent $1/3$ of the $N$-dependence of the golden time is universal even in other models showing discontinuous transitions induced by cascading dynamics, the measured $\zeta$ exponents are all close to $1/4$ but show model-dependence. It remains open whether or not $\zeta$ reduces to $1/4$ in the asymptotically large-$N$ limit.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1706.08968/full.md

## Figures

8 figures with captions in the complete paper: https://tomesphere.com/paper/1706.08968/full.md

## References

33 references — full list in the complete paper: https://tomesphere.com/paper/1706.08968/full.md

---
Source: https://tomesphere.com/paper/1706.08968