Pandemic spread in communities via random graphs
<jats:title>Abstract</jats:title> <jats:p>Working in the multi-type Galton–Watson branching-process framework we analyse the spread of a pandemic via a general multi-type random contact graph. Our model consists of several communities, and takes, as input, parameter...
Main Authors: | Minzer, Dor, Oz, Yaron, Safra, Muli, Wainstain, Lior |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | English |
Published: |
IOP Publishing
2022
|
Online Access: | https://hdl.handle.net/1721.1/145802 |
Similar Items
-
Characterizing Direct Product Testing via Coboundary Expansion
by: Bafna, Mitali, et al.
Published: (2024) -
The community-degree graph model and its implications on epidemic spread in social networks
by: Tan, Jinin Liang
Published: (2024) -
Approximating the influence of monotone boolean functions in O(√n) query complexity
by: Ron, Dana, et al.
Published: (2012) -
Transduction on directed graphs via absorbing random walks
by: De, Jaydeep, et al.
Published: (2020) -
Near Optimal Alphabet-Soundness Tradeoff PCPs
by: Minzer, Dor, et al.
Published: (2024)