Entropy-based random models for hypergraphs
Network science has traditionally focused on pairwise relationships while disregarding many-body interactions. Hypergraphs are promising mathematical objects for the description of the latter ones. Here, we propose null models to analyse hypergraphs that generalise the classical Erdös-Rényi and Conf...
| Main Authors: | , , , |
|---|---|
| Format: | Internet publication |
| Language: | English |
| Published: |
2022
|
| _version_ | 1826310475692900352 |
|---|---|
| author | Saracco, F Petri, G Lambiotte, R Squartini, T |
| author_facet | Saracco, F Petri, G Lambiotte, R Squartini, T |
| author_sort | Saracco, F |
| collection | OXFORD |
| description | Network science has traditionally focused on pairwise relationships while disregarding many-body interactions. Hypergraphs are promising mathematical objects for the description of the latter ones. Here, we propose null models to analyse hypergraphs that generalise the classical Erdös-Rényi and Configuration Model by randomising incidence matrices in a constrained fashion. After discussing them, we extend the definition of several network quantities to hypergraphs, derive their expected values and compare them with empirical ones, to detect significant deviations from random behaviours. |
| first_indexed | 2024-03-07T07:52:30Z |
| format | Internet publication |
| id | oxford-uuid:1e2dbe18-f342-4371-a0ec-27df226620a9 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T07:52:30Z |
| publishDate | 2022 |
| record_format | dspace |
| spelling | oxford-uuid:1e2dbe18-f342-4371-a0ec-27df226620a92023-08-02T10:58:57ZEntropy-based random models for hypergraphsInternet publicationhttp://purl.org/coar/resource_type/c_7ad9uuid:1e2dbe18-f342-4371-a0ec-27df226620a9EnglishSymplectic Elements2022Saracco, FPetri, GLambiotte, RSquartini, TNetwork science has traditionally focused on pairwise relationships while disregarding many-body interactions. Hypergraphs are promising mathematical objects for the description of the latter ones. Here, we propose null models to analyse hypergraphs that generalise the classical Erdös-Rényi and Configuration Model by randomising incidence matrices in a constrained fashion. After discussing them, we extend the definition of several network quantities to hypergraphs, derive their expected values and compare them with empirical ones, to detect significant deviations from random behaviours. |
| spellingShingle | Saracco, F Petri, G Lambiotte, R Squartini, T Entropy-based random models for hypergraphs |
| title | Entropy-based random models for hypergraphs |
| title_full | Entropy-based random models for hypergraphs |
| title_fullStr | Entropy-based random models for hypergraphs |
| title_full_unstemmed | Entropy-based random models for hypergraphs |
| title_short | Entropy-based random models for hypergraphs |
| title_sort | entropy based random models for hypergraphs |
| work_keys_str_mv | AT saraccof entropybasedrandommodelsforhypergraphs AT petrig entropybasedrandommodelsforhypergraphs AT lambiotter entropybasedrandommodelsforhypergraphs AT squartinit entropybasedrandommodelsforhypergraphs |