Counting simplicial pairs in hypergraphs

DOI10.1093/COMNET/CNAF021MaRDI QIDQ6920905zbMATH OpenFDO

Authors Jordan Mitchell Barrett, Paweł Prałat, Aaron Smith, François Théberge

Publication date 6 October 2025

Published in Journal of Complex Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1093/COMNET/CNAF021

zbMATH Keywords

hypergraphssimplicial Chung-Lu modelsimpliciality

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Hypergraphs (05C65) Combinatorial aspects of simplicial complexes (05E45)

Cites work

• An unsupervised framework for comparing graph embeddings
• Complex graphs and networks
• Hyperlink communities in higher-order networks
• Modularity based community detection in hypergraphs
• Network science. With Márton Pósfai
• Networks
• Networks beyond pairwise interactions: structure and dynamics
• Networks, crowds and markets. Reasoning about a highly connected world.
• Social and economic networks.
• The why, how, and when of representations for complex systems

This page was built for publication: Counting simplicial pairs in hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920905)