Epidemics on hypergraphs: spectral thresholds for extinction

  title={Epidemics on hypergraphs: spectral thresholds for extinction},
  author={Desmond J. Higham and Henry-Louis de Kergorlay},
  journal={Proceedings. Mathematical, Physical, and Engineering Sciences},
Epidemic spreading is well understood when a disease propagates around a contact graph. In a stochastic susceptible–infected–susceptible setting, spectral conditions characterize whether the disease vanishes. However, modelling human interactions using a graph is a simplification which only considers pairwise relationships. This does not fully represent the more realistic case where people meet in groups. Hyperedges can be used to record higher order interactions, yielding more faithful and… 

Figures from this paper

Capturing complex interactions in disease ecology with simplicial sets.

A novel approach is developed to identify how pathogens persist within a host population using simplicial sets, highlighting specific metrics, generative models and software.

Disease extinction for susceptible-infected-susceptible models on dynamic graphs and hypergraphs.

We consider stochastic, individual-level susceptible-infected-susceptible models for the spread of disease, opinion, or information on dynamic graphs and hypergraphs. We set up "snapshot" models

Generative Hypergraph Models and Spectral Embedding

It is shown that the hypergraph approach can outperform clustering algorithms that use only dyadic edges and compare several triadic edge prediction methods on high school contact data where the algorithm improves upon benchmark methods when the amount of training data is limited.

Hyper-diffusion on multiplex networks

By combining tools of spectral graph theory, applied topology and network science, this work provides a general understanding of hyper-diffusion on duplex networks, a dynamical process in which diffusion on each single layer is coupled with the diffusion in other layers thanks to the presence of higher-order interactions occurring when there exists link overlap.

On Some General Operators of Hypergraphs

Here we introduce connectivity operators, namely, diffusion operators, general Laplacian operators, and general adjacency operators for hypergraphs. These operators are generalisations of some

Core-periphery detection in hypergraphs

This work proposes a model of core-periphery for higher-order networks modeled as hypergraphs and proposes a method for computing a core-score vector that quantifies how close each node is to the core.

An Invitation to Higher Arity Science

Analytical thinking is dominated by binary ideas. From pair-wise interactions, to algebraic operations, to compositions of processes, to network models, binary structures are deeply ingrained in the

Overleaf Example

  • 2022

Hypergraph assortativity: A dynamical systems perspective.

The largest eigenvalue of the matrix describing a network's contact structure is often important in predicting the behavior of dynamical processes. We extend this notion to hypergraphs and motivate


We typically interact in groups, not just in pairs. For this reason, it has recently been proposed that the spread of information, opinion or disease should be modelled over a hypergraph rather than



SIS Epidemic Propagation on Hypergraphs

The exact master equations of the propagation process are derived for an arbitrary hypergraph given by its incidence matrix, and moment closure approximation and mean-field models are introduced and compared to individual-based stochastic simulations.

The effect of network topology on the spread of epidemics

  • A. GaneshL. MassouliéD. Towsley
  • Mathematics, Computer Science
    Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
  • 2005
This paper identifies topological properties of the graph that determine the persistence of epidemics and shows that if the ratio of cure to infection rates is larger than the spectral radius of thegraph, then the mean epidemic lifetime is of order log n, where n is the number of nodes.

The effect of heterogeneity on hypergraph contagion models

A hyperdegree-based mean-field description of the dynamics of the susceptible–infected–susceptible model on hypergraphs is presented and it is found that explosive transitions can be suppressed by heterogeneity in the link degree distribution when links and triangles are chosen independently or when link and triangle connections are positively correlated when compared to the uncorrelated case.

Social contagion models on hypergraphs

An analytical framework is developed and the concept of latent heat is extended to social contexts, which might help understanding oscillatory social behaviors and unfold the research line of higher-order models and the analytical treatment of hypergraphs.

Simplicial models of social contagion

Higher-order social interactions, the effects of groups, are included in their model of social contagion, enabling insight into why critical masses are required to initiate social changes and contributing to the understanding of higher-order interactions in complex systems.

COVID-19 and SARS-CoV-2

Networks beyond pairwise interactions: structure and dynamics

Modelling the COVID-19 epidemic and implementation of population-wide interventions in Italy

It is demonstrated that restrictive social-distancing measures will need to be combined with widespread testing and contact tracing to end the ongoing COVID-19 pandemic.

Evolutionary dynamics of higher-order interactions in social networks

This work shows that the game on uniform hypergraphs corresponds to the replicator dynamics in the well-mixed limit, providing a formal theoretical foundation to study cooperation in networked groups and unveil how the presence of hubs and the coexistence of interactions in groups of different sizes affects the evolution of cooperation.