3 papers
math.PR2026
Simplicity of random hypergraphs
Yanna J. Kraakman, Clara Stegehuis
Random hypergraphs extend the classical notion of random graphs by allowing hyperedges to join more than two vertices, making them well-suited for modeling higher-order interaction…
math.CO2026
Uniformly sampling random directed hypergraphs with fixed degrees
Yanna J. Kraakman, Clara Stegehuis
Many complex systems show non-pairwise interactions, which can be captured by hypergraphs. In this work, we propose an edge-swapping method to sample random directed hypergraphs wi…
math.CO2025
Hypercurveball algorithm for sampling hypergraphs with fixed degrees
Yanna J. Kraakman, Clara Stegehuis
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 m…