Optimal resource allocation for competing epidemics over arbitrary networks

摘要: This paper studies an SI 1 2 S spreading model of two competing behaviors over a bilayer network. In particular, we address the problem determining resource allocation strategies that ensure extinction one behavior while not necessarily ensuring other, and pose marketing in which such can be use. Our discussion begins by extending to nodedependent infection recovery parameters generalized graph topologies, contrasting prior work. We then find conditions under chosen epidemic becomes extinct. show distribution resources realizes this goal always exists for some budget mild assumptions. case available is sufficient establishing analytic means mitigating rate unwanted behavior. demonstrate method tractably computing solutions each via geometric programming. results are validated through simulation.