This is a preview. Log in through your library . Abstract For integers l ≥ 1, d ≥ 0 we study (undirected) graphs with vertices 1,..., n such that the vertices can be partitioned into l parts such that ...
We consider a stochastic SIR (susceptible → infective → recovered) epidemic defined on a configuration model random graph, in which infective individuals can infect only their neighbours in the graph ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback