Counting simplicial pairs in hypergraphs
Journal of Complex Networks · 26.06.2025 · 13 (4)
DOI: 10.1093/comnet/cnaf021 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Complex Networks, online erschienen am 17.08.2025. Verfasst von Jordan Barrett und 3 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 37 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
We present two ways to measure the simplicial nature of a hypergraph: the simplicial ratio and the simplicial matrix. We show that the simplicial ratio captures the frequency, as well as the rarity, of simplicial interactions in a hypergraph while the simplicial matrix provides more fine-grained details. We then compute the simplicial ratio, as well as the simplicial matrix, for 10 real-world hypergraphs and, from the data collected, hypothesize that simplicial interactions are more and more deliberate as hyperedge size increases. We then present a new Chung-Lu model that includes a parameter controlling (in expectation) the frequency of simplicial interactions. We use this new model, as well as the real-world hypergraphs, to show that multiple stochastic processes exhibit different behaviour when performed on simplicial hypergraphs vs. non-simplicial hypergraphs.
Zitieren
APA
Barrett, J., Prałat, P., Smith, A., & Théberge, F. (2025). Counting simplicial pairs in hypergraphs. Journal of Complex Networks, 13(4). https://doi.org/10.1093/comnet/cnaf021
Vancouver
Barrett J, Prałat P, Smith A, Théberge F. Counting simplicial pairs in hypergraphs. Journal of Complex Networks. 2025;13(4). doi:10.1093/comnet/cnaf021
BibTeX
@article{Barrett2025,
author = {Barrett, Jordan and Prałat, Paweł and Smith, Aaron and Théberge, François},
title = {Counting simplicial pairs in hypergraphs},
journal = {Journal of Complex Networks},
year = {2025},
volume = {13},
number = {4},
doi = {10.1093/comnet/cnaf021}
}
EUVIMED