13 citations · 49 across the 10 of their papers we have counts for
10 papers
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…
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…
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…
The isomorphic version of Brualdies nestedness is in P
Annabell Berger
The discrepancy BR for an -matrix from Brualdi and Sanderson \cite{Brualdi1998} counts the minimum number of 's which need to be shifted in each row to the lef…
Marathon: An open source software library for the analysis of Markov-Chain Monte Carlo algorithms
Steffen Rechner, Annabell Berger
In this paper, we consider the Markov-Chain Monte Carlo (MCMC) approach for random sampling of combinatorial objects. The running time of such an algorithm depends on the total mix…
Broder's Chain Is Not Rapidly Mixing
Annabell Berger, Steffen Rechner
We prove that Broder's Markov chain for approximate sampling near-perfect and perfect matchings is not rapidly mixing for Hamiltonian, regular, threshold and planar bipartite graph…
The Connection between the Number of Realizations for Degree Sequences and Majorization
Annabell Berger
The \emph{graph realization problem} is to find for given nonnegative integers a simple graph (no loops or multiple edges) such that each vertex has degree $a…
How to Attack the NP-complete Dag Realization Problem in Practice
Annabell Berger, Matthias Müller-Hannemann
We study the following fundamental realization problem of directed acyclic graphs (dags). Given a sequence S:=(a_1,b_1),...,(a_n, b_n) with a_i, b_i in Z_0^+, does there exist a da…
A Note on the Characterization of Digraph Sequences
Annabell Berger
We consider the following fundamental realization problem of directed graphs. Given a sequence with Does…
Uniform sampling of undirected and directed graphs with a fixed degree sequence
Annabell Berger, Matthias Müller-Hannemann
Many applications in network analysis require algorithms to sample uniformly at random from the set of all graphs with a prescribed degree sequence. We present a Markov chain based…