arXiv · 2106.12162
Randomizing hypergraphs preserving degree correlation and local clustering
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.
Explore related subjects
Keep this discovery
Kazuki Nakajima, Kazuyuki Shudo, Naoki Masuda. 2021-06-23. Randomizing hypergraphs preserving degree correlation and local clustering. https://doi.org/10.1109/tnse.2021.3133380
Cite the original work for its findings. Save a collection to share your selection of sources.