Hypergraph assortativity: a dynamical systems perspective

Abstract

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 the importance of an analogous eigenvalue, the expansion eigenvalue, for hypergraph dynamical processes. Using a mean-field approach, we derive an approximation to the expansion eigenvalue in terms of the degree sequence for uncorrelated hypergraphs. We introduce a generative model for hypergraphs that includes degree assortativity, and use a perturbation approach to derive an approximation to the expansion eigenvalue for assortative hypergraphs. We define the dynamical assortativity, a dynamically sensible definition of assortativity for uniform hypergraphs, and describe how reducing the dynamical assortativity of hypergraphs through preferential rewiring can extinguish epidemics. We validate our results with both synthetic and empirical datasets.

11 pages, 4 figures

References in corpus (17)

• Dynamics on higher-order networks: A review
• A message passing approach for general epidemic models
• Unification of theoretical approaches for epidemic spreading on complex networks
• Percolation on sparse networks
• Abrupt Desynchronization and Extensive Multistability in Globally Coupled Oscillator Simplices
• Abrupt phase transition of epidemic spreading in simplicial complexes
• Approximating the largest eigenvalue of network adjacency matrices
• Percolation on correlated networks
• Higher-order percolation processes on multiplex hypergraphs
• Weighted percolation on directed networks
• Clustering in graphs and hypergraphs with categorical edge labels
• Network clique cover approximation to analyze complex contagions through group interactions
• Belief propagation for networks with loops
• Mean field theory of assortative networks of phase oscillators
• Epidemics on Hypergraphs: Spectral Thresholds for Extinction
• Assortative mixing by degree makes a network more unstable
• Higher-order Network Analysis Takes Off, Fueled by Classical Ideas and New Data

Cited by in corpus (7)

• Distinguishing simple and complex contagion processes on networks
• Hyper-cores promote localization and efficient seeding in higher-order processes
• The simpliciality of higher-order networks
• Simplicial cascades are orchestrated by the multidimensional geometry of neuronal complexes
• Opinion disparity in hypergraphs with community structure
• Filtering higher-order datasets
• Nonmonotonic percolation threshold in correlated networks and hypergraphs