4 papers
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…
Homophily Within and Across Groups
Abbas K. Rizi, Riccardo Michielan, Clara Stegehuis +1
Homophily -- the tendency of individuals to interact with similar others -- shapes how networks form and function. Yet existing approaches typically collapse homophily to a single…
Stationary distribution of node2vec random walks on household models
Lars Schroeder, Clara Stegehuis
The node2vec random walk has proven to be a key tool in network embedding algorithms. These random walks are tuneable, and their transition probabilities depend on the previous vis…
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…