8 citations · 10 across the 13 of their papers we have counts for
4 papers · 1 filter
Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals
Georgios Amanatidis, Pieter Kleer
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 application…
Sampling hypergraphs with given degrees
Martin Dyer, Catherine Greenhill, Pieter Kleer +2
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 grap…
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices
Georgios Amanatidis, Pieter Kleer
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 comparison a…
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…