Campaigning in Heterogeneous Social Networks: Optimal Control of SI Information Epidemics
Kundan Kandhway, Joy Kuri

TL;DR
This paper develops an optimal control framework for maximizing information spread in social networks modeled as SI epidemics, considering network heterogeneity and resource allocation strategies.
Contribution
It introduces a novel optimal control approach accounting for degree-dependent controls and network heterogeneity, with solutions applicable to various network types and epidemic models.
Findings
More resources are allocated to high-degree nodes in scale-free networks.
Optimal strategies outperform static and bang-bang controls.
Network degree distribution significantly influences control allocation.
Abstract
We study the optimal control problem of maximizing the spread of an information epidemic on a social network. Information propagation is modeled as a Susceptible-Infected (SI) process and the campaign budget is fixed. Direct recruitment and word-of-mouth incentives are the two strategies to accelerate information spreading (controls). We allow for multiple controls depending on the degree of the nodes/individuals. The solution optimally allocates the scarce resource over the campaign duration and the degree class groups. We study the impact of the degree distribution of the network on the controls and present results for Erdos-Renyi and scale free networks. Results show that more resource is allocated to high degree nodes in the case of scale free networks but medium degree nodes in the case of Erdos-Renyi networks. We study the effects of various model parameters on the optimal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
