13 citations · 18 across the 3 of their papers we have counts for
4 papers
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades
Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer +3
Graph randomisation is a crucial task in the analysis and synthesis of networks. It is typically implemented as an edge switching process (ESMC) repeatedly swapping the nodes of ra…
Smaller Universes for Uniform Sampling of 0,1-matrices with fixed row and column sums
Annabell Berger, Corrie Jacobien Carstens
An important problem arising in the study of complex networks, for instance in community detection and motif finding, is the sampling of graphs with fixed degree sequence. The equi…
Comparing the Switch and Curveball Markov Chains for Sampling Binary Matrices with Fixed Marginals
Corrie Jacobien Carstens, Pieter Kleer
The Curveball algorithm is a variation on well-known switch-based Markov chain approaches for uniformly sampling binary matrices with fixed row and column sums. Instead of a switch…
A unifying framework for fast randomization of ecological networks with fixed (node) degrees
Corrie Jacobien Carstens, Annabell Berger, Giovanni Strona
The switching model is a Markov chain approach to sample graphs with fixed degree sequence uniformly at random. The recently invented Curveball algorithm for bipartite graphs appli…