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.

arXiv comment11 pages, 4 figures

References in corpus (36)

• Assortative mixing in networks
• Mixing patterns in networks
• Networks beyond pairwise interactions: structure and dynamics
• Simplicial models of social contagion
• Epidemic spreading in correlated complex networks
• 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
• The onset of synchronization in large networks of coupled oscillators
• Percolation on sparse networks
• Abrupt Desynchronization and Extensive Multistability in Globally Coupled Oscillator Simplices
• Social contagion models on hypergraphs
• Epidemic Incidence in Correlated Complex Networks
• Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes
• The effect of heterogeneity on hypergraph contagion models
• Abrupt phase transition of epidemic spreading in simplicial complexes
• Multi-body Interactions and Non-Linear Consensus Dynamics on Networked Systems
• Approximating the largest eigenvalue of network adjacency matrices
• Percolation on correlated networks
• Higher-order percolation processes on multiplex hypergraphs
• Degree-degree correlations in random graphs with heavy-tailed degrees
• Uncovering disassortativity in large scale-free networks
• Robustness and Assortativity for Diffusion-like Processes in Scale-free Networks
• Construction of and efficient sampling from the simplicial configuration model
• Clustering via Hypergraph Modularity
• Relating Topological Determinants of Complex Networks to Their Spectral Properties: Structural and Dynamical Effects
• Clustering in graphs and hypergraphs with categorical edge labels
• Weighted percolation on directed networks
• Network clique cover approximation to analyze complex contagions through group interactions
• Social confinement and mesoscopic localization of epidemics on networks
• Belief propagation for networks with loops
• Mean field theory of assortative networks of phase oscillators
• Epidemics on Hypergraphs: Spectral Thresholds for Extinction
• Network constraints on the mixing patterns of binary node metadata
• 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