Towards random uniform sampling of bipartite graphs with given degree sequence

István Miklós, Péter L. Erdos, Lajos Soukup

Research output: Contribution to journalArticle

21 Citations (Scopus)

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 half-regular degree sequence. The novelty of our approach lies in the construction of the multicommodity flow in Sinclair's method.

Original languageEnglish
JournalElectronic Journal of Combinatorics
Volume20
Issue number1
DOIs
Publication statusPublished - Jan 21 2013

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Towards random uniform sampling of bipartite graphs with given degree sequence'. Together they form a unique fingerprint.

  • Cite this