Take the initial removed set to be empty, as required by the displayed equality in this discrete SIR epidemic on a graph. If initially removed individuals are allowed, add their indicators to the final-removal count; an isolated initially removed vertex already shows why this correction is necessary. Condition on a fixed initial infection vector.
Given the history through time , the union bound over currently infected neighbours gives
Write . Taking expectations and iterating this componentwise inequality for the nonnegative adjacency matrix of a graph gives .
A vertex is infected at most once, and an infection lasts exactly one step before permanent removal. Hence under the stated initial convention. The Tonelli theorem now gives
The walk count from powers of an adjacency matrix explains the terms: all possible transmission walks are counted, including walks that overcount because removal prevents reinfection. This is the adjacency-matrix bound for a discrete SIR epidemic.
Put and . Sum the bounds in part (a) over the vertices, using linearity of expectation and the Tonelli theorem for the nonnegative series:
The bound remains valid if the series diverges, although it then gives no finite estimate. When the spectral radius of is less than one, the series is a Neumann series, giving the resolvent bound for a discrete SIR epidemic.
Because is a real symmetric matrix, the spectral theorem gives . For , the Neumann series satisfies
Let be the initial infected count. Since its entries are indicator random variables, , while . The Cauchy-Schwarz inequality and the operator norm bound yield
Thus a sufficient asymptotic condition for a small outbreak is
For example, it holds when and for a fixed . For any fixed , the Markov inequality then gives
This is the spectral condition for a small discrete SIR outbreak. A uniform gap and few initial infections are needed for this conclusion; the finite-population condition alone does not control an asymptotically vanishing gap or an initially macroscopic infected set.

Articles by others on the same topic (0)

There are currently no matching articles.