Discrete SIR epidemic on a graph

In this discrete-time SIR model, each infected vertex is infectious for one step, can infect each susceptible neighbour with probability $\beta$, and is then permanently removed. The adjacency matrix of a graph describes the possible transmissions. If the initial removed set is empty, eventual removal and ever becoming infected are the same event.