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.
Skip Nav Destination
Hypergraph assortativity: A dynamical systems perspective
Article navigation
Research Article|
May 06 2022
Hypergraph assortativity: A dynamical systems perspective
Available to Purchase
Special Collection:
Dynamics on Networks with Higher-Order Interactions
Nicholas W. Landry
;
Nicholas W. Landry
a)
Department of Applied Mathematics, University of Colorado at Boulder
, Boulder, Colorado 80309, USA
a)Author to whom correspondence should be addressed: [email protected]
Search for other works by this author on:
Juan G. Restrepo
Juan G. Restrepo
b)
Department of Applied Mathematics, University of Colorado at Boulder
, Boulder, Colorado 80309, USA
Search for other works by this author on:
Nicholas W. Landry
a)
Department of Applied Mathematics, University of Colorado at Boulder
, Boulder, Colorado 80309, USA
Juan G. Restrepo
b)
Department of Applied Mathematics, University of Colorado at Boulder
, Boulder, Colorado 80309, USA
a)Author to whom correspondence should be addressed: [email protected]
b)
Electronic mail: [email protected]
Note: This article is part of the Focus Issue, Dynamics on Networks with Higher-Order Interactions.
Chaos 32, 053113 (2022)
Article history
Received:
January 30 2022
Accepted:
April 12 2022
Citation
Nicholas W. Landry, Juan G. Restrepo; Hypergraph assortativity: A dynamical systems perspective. Chaos 1 May 2022; 32 (5): 053113. https://doi.org/10.1063/5.0086905
Download citation file:
Pay-Per-View Access
$40.00
Sign In
You could not be signed in. Please check your credentials and make sure you have an active account and try again.
Citing articles via
Rogue waves: Theory, methods, and applications—30 years after the Draupner wave
Zhenya Yan, Boris A. Malomed, et al.
Selecting embedding delays: An overview of embedding techniques and a new method using persistent homology
Eugene Tan, Shannon Algar, et al.
Enhancing reservoir predictions of chaotic time series by incorporating delayed values of input and reservoir variables
Luk Fleddermann, Sebastian Herzog, et al.
Related Content
The effect of heterogeneity on hypergraph contagion models
Chaos (October 2020)
Synchronization of phase oscillators on complex hypergraphs
Chaos (March 2023)
Spontaneous recovery in random hypergraphs
Chaos (July 2024)
Dynamics of the threshold model on hypergraphs
Chaos (February 2022)
Bootstrap percolation on hypergraph
Chaos (April 2025)