Towards random uniform sampling of bipartite graphs with given degree sequence
Combinatorics
2021-01-01 v4
Abstract
In this paper we consider a simple Markov chain for bipartite graphs with given degree sequence on vertices. We show that the mixing time of this Markov chain is bounded above by a polynomial in in case of {\em semi-regular} degree sequence. The novelty of our approach lays in the construction of the canonical paths in Sinclair's method.
Keywords
Cite
@article{arxiv.1004.2612,
title = {Towards random uniform sampling of bipartite graphs with given degree sequence},
author = {Péter L. Erdös and Istán Miklós and Lajos Soukup},
journal= {arXiv preprint arXiv:1004.2612},
year = {2021}
}
Comments
47 pages, submitted for publication. In this version we explain explicitly our main contribution and corrected a serious flaw in the cycle decomposition