Abstract
AbstractNetworks can describe the structure of a wide variety of complex systems by specifying which pairs of entities in the system are connected. While such pairwise representations are flexible, they are not necessarily appropriate when the fundamental interactions involve more than two entities at the same time. Pairwise representations nonetheless remain ubiquitous, because higher-order interactions are often not recorded explicitly in network data. Here, we introduce a Bayesian approach to reconstruct latent higher-order interactions from ordinary pairwise network data. Our method is based on the principle of parsimony and only includes higher-order structures when there is sufficient statistical evidence for them. We demonstrate its applicability to a wide range of datasets, both synthetic and empirical.
Funder
James S. McDonnell Foundation
Publisher
Springer Science and Business Media LLC
Subject
General Physics and Astronomy
Reference77 articles.
1. Williamson, S. A. & Tec, M. Random clique covers for graphs with local density and global sparsity. Proceedings of The 35th Uncertainty in Artificial Intelligence Conference, in Proceedings of Machine Learning Research, 115, 228–238 (2020).
2. Newman, M. Networks 2nd edn (Oxford Univ. Press, 2018).
3. Frank, O. & Strauss, D. Markov graphs. J. Am. Stat. Assoc. 81, 832–842 (1986).
4. Iacobucci, D. & Wasserman, S. Social networks with two sets of actors. Psychometrika 55, 707–720 (1990).
5. Watts, D. J., Dodds, P. S. & Newman, M. E. J. Identity and search in social networks. Science 296, 1302–1305 (2002).
Cited by
60 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献