26 citations · 105 across the 26 of their papers we have counts for
Showing 2017 · cs.DMShow all
2 papers · 2 filters
cs.DM2017
The switch Markov chain for sampling irregular graphs and digraphs
Catherine Greenhill, Matteo Sfragara
The problem of efficiently sampling from a set of (undirected, or directed) graphs with a given degree sequence has many applications. One approach to this problem uses a simple Ma…
cs.DM2017
The flip Markov chain for connected regular graphs
Colin Cooper, Martin Dyer, Catherine Greenhill +1
Mahlmann and Schindelhauer (2005) defined a Markov chain which they called -Flipper, and showed that it is irreducible on the set of all connected regular graphs of a given degr…