39 citations · 193 across the 19 of their papers we have counts for
1 paper · 1 filter
Péter L. Erdös, Istán Miklós, Lajos Soukup
In this paper we consider a simple Markov chain for bipartite graphs with given degree sequence on n vertices. We show that the mixing time of this Markov chain is bounded above…