Effective epidemic containment strategy in hypergraphs

Abstract

Recently, hypergraphs have attracted considerable interest from the research community as a generalization of networks capable of encoding higher-order interactions, which commonly appear in both natural and social systems. Epidemic dynamics in hypergraphs has been studied by using the simplicial susceptible-infected-susceptible ($s$-SIS) model; however, the efficient immunization strategy for epidemics in hypergraphs is not studied despite the importance of the topic in mathematical epidemiology. Here, we propose an immunization strategy that immunizes hyperedges with high simultaneous infection probability (SIP). This strategy can be implemented in general hypergraphs. We also generalize the edge epidemic importance (EI)-based immunization strategy, which is the state of the art in complex networks. However, it does not perform as well as the SIP-based method in hypergraphs despite its high computational cost. We also show that immunizing hyperedges with high H-eigenscore effectively contains the epidemics in uniform hypergraphs. A high SIP of a hyperedge suggests that the hyperedge is a "hotspot" of the epidemic process. Therefore, SIP can be used as a centrality measure to quantify a hyperedge's influence on higher-order dynamics in general hypergraphs. The effectiveness of the immunization strategies suggests the necessity of scientific, data-driven, systematic policy-making for epidemic containment.

References in corpus (15)

• Critical phenomena in complex networks
• Efficient Immunization Strategies for Computer Networks and Populations
• Theory of Rumour Spreading in Complex Social Networks
• Epidemic thresholds of the Susceptible-Infected-Susceptible model on networks: A comparison of numerical and theoretical results
• Random walks on hypergraphs
• Analytical computation of the epidemic threshold on temporal networks
• Abrupt phase transition of epidemic spreading in simplicial complexes
• Simplicial contagion in temporal higher-order networks
• Simplicial SIS model in scale-free uniform hypergraph
• Evolution of Cooperation in the Presence of Higher-Order Interactions: from Networks to Hypergraphs
• Disease and information spreading at different speeds in multiplex networks
• Quasi-stationary analysis of the contact process on annealed scale-free networks
• Non massive immunization to contain spreading on complex networks
• Mixed-order phase transition in a two-step contagion model with single infectious seed
• Tricritical directed percolation with long-range interaction in one and two dimensions

Cited by in corpus (5)

• Prediction and mitigation of nonlocal cascading failures using graph neural networks
• Adaptive Epidemic Dynamics on Hypergraphs with Group-Level Immunization and Rewiring
• Extremal statistics for first-passage trajectories of drifted Brownian motion under stochastic resetting
• Epidemic extinction in a simplicial susceptible-infected-susceptible model
• Abrupt transition of the efficient vaccination strategy in a population with heterogeneous fatality rates