Law of large numbers for the SIR epidemic on a random graph with given degrees
Law of large numbers for the SIR epidemic on a random graph with given degrees
Abstract We study the susceptibleāinfectiveārecovered (SIR) epidemic on a random graph chosen uniformly subject to having given vertex degrees. In this model infective vertices infect each of their susceptible neighbours, and recover, at a constant rate. Suppose that initially there are only a few infective vertices. We prove there is ā¦