Towards random uniform sampling of bipartite graphs with given degree sequence

Miklós, István and Erdős, Péter and Soukup, Lajos (2013) Towards random uniform sampling of bipartite graphs with given degree sequence. ELECTRONIC JOURNAL OF COMBINATORICS, 20 (1). ISSN 1077-8926

[img]
Preview
Text
Miklos_1_2440949_ny.pdf

Download (566kB) | Preview

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.

Item Type: Article
Additional Information: FELTÖLTÉSI MEGJEGYZÉS: Nyílt - OA
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 05 Feb 2014 15:52
Last Modified: 05 Feb 2014 16:00
URI: http://eprints.sztaki.hu/id/eprint/7561

Update Item Update Item