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 by a polynomial in n in case of half-regular degree sequence. The novelty of our approach lies in the construction of the multicommodity flow in Sinclair's method.
No takes yet. Share an insight, caveat, or question.
Miklós et al. (2013) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: