Upper decay-bound conjecture for NIMFA SIS prevalence below threshold

Let GG be a graph, let KNK_N be the complete graph on NN vertices, let uu denote the all-infected initial infection-probability vector, and let V(0)V(0) be an initial infection-probability vector. Write y(t;G,τ,V(0))y(t;G,\tau,V(0)) for the prevalence of the epidemic process on GG with effective infection rate τ\tau, and let τc(1)(G)\tau_c^{(1)}(G) denote the epidemic threshold. Upper decay-bound conjecture. If ττc(1)(G)\tau\leq\tau_c^{(1)}(G), then

y(t;G,τ,V(0))y(t;G,τc(1)(G),u)y(t;KN,τc(1)(KN),u)=11+t.y(t;G,\tau,V(0))\leq y(t;G,\tau_c^{(1)}(G),u)\leq y(t;K_N,\tau_c^{(1)}(K_N),u)=\frac{1}{1+t}.

The formula for the complete graph is proved in the cited lemma, while the displayed upper bound is supported analytically in the appendix; the parser marks this conjecture as resolved.

Sources & referencesView supporting material

Primary source

Robin Persoons, Mattia Sensi, Bastian Prasse and Piet Van Mieghem, “Transition from time-variant to static networks: timescale separation in NIMFA SIS epidemics”, arXiv:2305.12446 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.