There is a well-known connection between hypergraphs and bipartite graphs, obtained by
treating the incidence matrix of the hypergraph as the biadjacency matrix of a bipartite …

Graphs are used in many disciplines to model the relationships that exist between objects in
a complex discrete system. Researchers may wish to compare a network of interest to a" …

Uniform sampling of binary matrix with fixed margins is an important and difficult problem in
statistics, computer science, ecology and so on. The well-known swap algorithm would be …

The switch Markov chain has been extensively studied as the most natural Markov Chain
Monte Carlo approach for sampling graphs with prescribed degree sequences. We use …

The switch Markov chain has been extensively studied as the most natural Markov chain
Monte Carlo approach for sampling graphs with prescribed degree sequences. We show …

Many applications require randomly sampling bipartite graphs with fixed degrees or
randomly sampling incidence matrices with fixed row and column sums. Although several …

We consider the well-studied problem of uniformly sampling (bipartite) graphs with a given
degree sequence, or equivalently, the uniform sampling of binary matrices with fixed row …

The uniform sampling of simple graphs matching a prescribed degree sequence is an
important tool in network science, eg to construct graph generators or null-models. Here, the …

The switch Markov chain has been extensively studied as the most natural Markov chain
Monte Carlo approach for sampling graphs with prescribed degree sequences. In this work …

The approximate uniform sampling of graphs with a given degree sequence is a well-known,
extensively studied problem in theoretical computer science and has significant …