3 papers
math.CO2018
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…
math.CO2016
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…
math.CO2016
Sampling bipartite graphs with given vertex degrees and fixed edges and non-edges
Annabell Berger
We consider the problem of sampling a bipartite graph with given vertex degrees where a set of edges and non-edges which need to be contained is predefined. Our general result…