Hyper-Null Models and Their Applications
Open Access
Abstract
Null models are crucial tools for investigating network topological structures. However, research on null models for higher-order networks is still relatively scarce. In this study, we introduce an innovative method to construct null models for hypergraphs, namely the hyperedge swapping-based method. By preserving certain network properties while altering others, we generate six hyper-null models with various orders and analyze their interrelationships. To validate our approach, we first employ hypergraph entropy to assess the randomness of these null models across four datasets. Furthermore, we examine the differences in important statistical properties between the various null models and the original networks. Lastly, we investigate the impact of hypergraph randomness on network dynamics using the proposed hyper-null models, focusing on dismantling and epidemic contagion. The findings show that our proposed hyper-null models are applicable to various scenarios. By introducing a comprehensive framework for generating and analyzing hyper-null models, this research opens up avenues for further exploration of the intricacies of network structures and their real-world implications.Keywords
Funding Information
- STI 2030—Major Projects (2022ZD0211400, T2293771, 2023NSFSC1919)
- National Natural Science Foundation of China (2022ZD0211400, T2293771, 2023NSFSC1919)
- Sichuan Science and Technology Program (2022ZD0211400, T2293771, 2023NSFSC1919)
- New Cornerstone Science Foundation (2022ZD0211400, T2293771, 2023NSFSC1919)
This publication has 31 references indexed in Scilit:
- BiGG Models: A platform for integrating, standardizing and sharing genome-scale modelsNucleic Acids Research, 2015
- 2.5K-graphs: From sampling to generation2013
- Orbis2007
- Resolution limit in community detectionProceedings of the National Academy of Sciences, 2007
- Systematic topology analysis and generation using degree correlationsACM SIGCOMM Computer Communication Review, 2006
- Subgraph centrality and clustering in complex hyper-networksPhysica A: Statistical Mechanics and its Applications, 2006
- Superfamilies of Evolved and Designed NetworksScience, 2004
- Assortative Mixing in NetworksPhysical Review Letters, 2002
- Network Motifs: Simple Building Blocks of Complex NetworksScience, 2002
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948