EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Hypercurveball algorithm for sampling hypergraphs with fixed degrees

Yanna J Kraakman, Clara Stegehuis

Journal of Complex Networks · 26.06.2025 · 13 (4)

DOI: 10.1093/comnet/cnaf007 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Complex Networks, online erschienen am 12.07.2025. Verfasst von Yanna J Kraakman und 1 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 45 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Nederlandse Organisatie voor Wetenschappelijk Onderzoek.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Comparative analysis between a network and a random graph model can uncover network properties that significantly deviate from those in random networks. The standard random graph model used for comparison uniformly samples random graphs with the same degrees as the network data, often achieved through edge-swap algorithms. However, for hypergraphs, fewer such methodologies are available. This study introduces the Hypercurveball algorithm, designed to sample random, potentially directed, hypergraphs with fixed degrees. Minor adjustments enable the sampling of hypergraphs without degenerate hyperedges, self-loops, or multi-hyperedges. For most of these algorithms, we prove whether they sample uniformly or with bias. We experimentally show that the Hypercurveball algorithm can be significantly faster or slower than the standard hyperedge-shuffling algorithm, which is the hyperedge-equivalent of the edge-swap algorithm. We present criteria on the hypergraph degree sequence that indicate when the Hypercurveball algorithm is more efficient than the standard hyperedge-shuffling method. Finally, our experimental results suggest polynomial scaling of the mixing time for both the Hypercurveball and hyperedge-shuffling algorithms.

Förderung

  • Nederlandse Organisatie voor Wetenschappelijk Onderzoek

Zitieren

APA

Kraakman, Y. J., & Stegehuis, C. (2025). Hypercurveball algorithm for sampling hypergraphs with fixed degrees. Journal of Complex Networks, 13(4). https://doi.org/10.1093/comnet/cnaf007

Vancouver

Kraakman YJ, Stegehuis C. Hypercurveball algorithm for sampling hypergraphs with fixed degrees. Journal of Complex Networks. 2025;13(4). doi:10.1093/comnet/cnaf007

BibTeX
@article{Kraakman2025,
  author = {Kraakman, Yanna J and Stegehuis, Clara},
  title = {Hypercurveball algorithm for sampling hypergraphs with fixed degrees},
  journal = {Journal of Complex Networks},
  year = {2025},
  volume = {13},
  number = {4},
  doi = {10.1093/comnet/cnaf007}
}
Kostenlos starten →