Necessary and sufficient conditions for exact closures of epidemic equations on configuration model networks
We prove that the exact closure of SIR pairwise epidemic equations on a configuration model network is possible if and only if the degree distribution is Poisson, Binomial, or Negative Binomial. The proof relies on establishing, for these specific degree distributions, the equivalence of the closed pairwise model and the so-called dynamical survival analysis (DSA) edge-based model which was previously shown to be exact. Indeed, as we show here, the DSA model is equivalent to the well-known edge-based Volz model. We use this result to provide reductions of the closed pairwise and Volz models to the same single equation involving only susceptibles, which has a useful statistical interpretation in terms of the times to infection. We illustrate our findings with some numerical examples.
Code (0)
등록된 구현이 없습니다.
Tasks
Survival AnalysisSimilar Papers 제목 키워드 기반
Exact and approximate moment closures for non-Markovian network epidemics
Moment-closure techniques are commonly used to generate low-dimensional deterministic models to approximate the average dynamics of stochastic systems on networks. The quality of such closures is usually difficult to ass…
TripletSafe Schedule Verification for Urban Air Mobility Networks with Node Closures
In Urban Air Mobility (UAM) networks, takeoff and landing sites, called vertiports, are likely to experience intermittent closures due to, e.g., adverse weather. To ensure safety, all in-flight Urban Air Vehicles (UAVs) …
Community Detection: Exact Recovery in Weighted Graphs
In community detection, the exact recovery of communities (clusters) has been mainly investigated under the general stochastic block model with edges drawn from Bernoulli distributions. This paper considers the exact rec…
Community DetectionStochastic Block ModelComplete hierarchies of SIR models on arbitrary networks with exact and approximate moment closure
We first generalise ideas discussed by Kiss et al. (2015) to prove a theorem for generating exact closures (here expressing joint probabilities in terms of their constituent marginal probabilities) for susceptible-infect…
Exact Recovery of Community Detection in dependent Gaussian Mixture Models
We study the community detection problem on a Gaussian mixture model, in which (1) vertices are divided into $k\geq 2$ distinct communities that are not necessarily equally-sized; (2) the Gaussian perturbations for diffe…
Community Detection