192 citations · 529 across the 38 of their papers we have counts for
4 papers · 1 filter
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…
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…
Maximal Cliques in Scale-Free Random Graphs
Thomas Bläsius, Maximillian Katzmann, Clara Stegehuis
We investigate the number of maximal cliques, i.e., cliques that are not contained in any larger clique, in three network models: Erdős-Rényi random graphs, inhomogeneous random gr…
Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs
Clara Stegehuis
We investigate the asymptotic number of induced subgraphs in power-law uniform random graphs. We show that these induced subgraphs appear typically on vertices with specific degree…