192 citations · 529 across the 38 of their papers we have counts for
5 papers · 1 filter
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…
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…
Reconstruction of geometric random graphs with the Simple algorithm
Clara Stegehuis, Lotte Weedage
Graph reconstruction can efficiently detect the underlying topology of massive networks such as the Internet. Given a query oracle and a set of nodes, the goal is to obtain the edg…
Optimal subgraphs in geometric scale-free random graphs
Riccardo Michielan, Clara Stegehuis, Matthias Walter
Geometric scale-free random graphs are popular models for networks that exhibit as heavy-tailed degree distributions, small-worldness and high clustering. In these models, vertices…
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…