Randomizing hypergraphs preserving degree correlation and local clustering
arXiv:2106.12162 · doi:10.1109/TNSE.2021.3133380
Abstract
Many complex systems involve direct interactions among more than two entities and can be represented by hypergraphs, in which hyperedges encode higher-order interactions among an arbitrary number of nodes. To analyze structures and dynamics of given hypergraphs, a solid practice is to compare them with those for randomized hypergraphs that preserve some specific properties of the original hypergraphs. In the present study, we propose a family of such reference models for hypergraphs, called the hyper dK-series, by extending the so-called dK-series for dyadic networks to the case of hypergraphs. The hyper dK-series preserves up to the individual node's degree, node's degree correlation, node's redundancy coefficient, and/or the hyperedge's size depending on the parameter values. We also apply the hyper dK-series to numerical simulations of epidemic spreading and evolutionary game dynamics on empirical hypergraphs.
arXiv comment28 pages, 9 figures, 10 tables. Our code is available at "https://github.com/kazuibasou/hyper-dk-series"
References in corpus (45)
- Modularity and community structure in networks
- Assortative mixing in networks
- The structure of scientific collaboration networks
- Random graphs with arbitrary degree distributions and their applications
- Evolution of the social network of scientific collaborations
- Networks beyond pairwise interactions: structure and dynamics
- Dynamical and correlation properties of the Internet
- Higher-order organization of complex networks
- Simplicial models of social contagion
- High-resolution measurements of face-to-face contact patterns in a primary school
- Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys
- Evolutionary dynamics of higher-order interactions in social networks
- Simplicial Closure and higher-order link prediction
- Random graphs with clustering
- An efficient and principled method for detecting communities in networks
- The Statistical Physics of Real-World Networks
- Pattern Detection in Complex Networks: Correlation Profile of the Internet
- Bipartite Graphs as Models of Complex Networks
- Self-organization of collaboration networks
- Social contagion models on hypergraphs
- Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplacian
- Random graphs containing arbitrary distributions of subgraphs
- Quantifying randomness in real networks
- Efficiently inferring community structure in bipartite networks
- Multiorder Laplacian for synchronization in higher-order networks
- The effect of heterogeneity on hypergraph contagion models
- Randomizing bipartite networks: the case of the World Trade Web
- Multi-body Interactions and Non-Linear Consensus Dynamics on Networked Systems
- Tuning clustering in random networks with arbitrary degree distributions
- Systematic Topology Analysis and Generation Using Degree Correlations
- Evolutionary Games defined at the Network Mesoscale: The Public Goods game
- Coupled Dynamics on Hypergraphs: Master Stability of Steady States and Synchronization
- Inferring monopartite projections of bipartite networks: an entropy-based approach
- Simplicial SIS model in scale-free uniform hypergraph
- Consistency of Spectral Hypergraph Partitioning under Planted Partition Model
- Hypergraph Spectral Clustering in the Weighted Stochastic Block Model
- Breaking the spell of nestedness
- Social inertia in collaboration networks
- How Much and When Do We Need Higher-order Information in Hypergraphs? A Case Study on Hyperedge Prediction
- Evolution of Cooperation in the Presence of Higher-Order Interactions: from Networks to Hypergraphs
- Community Detection for Hypergraph Networks via Regularized Tensor Power Iteration
- Modelling Non-Linear Consensus Dynamics on Hypergraphs
- Community Detection in Bipartite Networks with Stochastic Blockmodels
- Exact sampling of graphs with prescribed degree correlations
- Cluster synchronization on hypergraphs
Cited by in corpus (8)
- Higher-order rich-club phenomenon in collaborative research grants
- Random Recursive Hypergraphs
- Fixation dynamics on hypergraphs
- Entropy-based models to randomize real-world hypergraphs
- Attributed Hypergraph Generation with Realistic Interplay Between Structure and Attributes
- Higher-order shortest paths in hypergraphs
- Higher-order null models as a lens for social systems
- Sampling nodes and hyperedges via random walks on large hypergraphs