{
  "id": "1004.2612",
  "version": "v4",
  "published": "2010-04-15T11:58:28.000Z",
  "updated": "2012-10-16T19:11:40.000Z",
  "title": "Towards random uniform sampling of bipartite graphs with given degree sequence",
  "authors": [
    "Péter L. Erdös",
    "Istán Miklós",
    "Lajos Soukup"
  ],
  "comment": "47 pages, submitted for publication. In this version we explain explicitly our main contribution and corrected a serious flaw in the cycle decomposition",
  "categories": [
    "math.CO"
  ],
  "abstract": "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 {\\em semi-regular} degree sequence. The novelty of our approach lays in the construction of the canonical paths in Sinclair's method.",
  "revisions": [
    {
      "version": "v4",
      "updated": "2012-10-16T19:11:40.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C07",
      "05C80"
    ],
    "keywords": [
      "degree sequence",
      "random uniform sampling",
      "bipartite graphs",
      "simple markov chain",
      "approach lays"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 47,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1004.2612E"
    }
  }
}