Geodesic
Towards random uniform sampling of bipartite graphs with given degree sequence
István Miklós1 ; Péter L Erdős1 ; Lajos Soukup1
1Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences
The electronic journal of combinatorics, Tome 20 (2013) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/3028
Classification : 05C80, 05C07, 60J10, 94C15, 05D40
Mots-clés : degree sequence, random sampling, multicommodity flow, sinclair's method, Markov chain

István Miklós  1   ; Péter L Erdős  1   ; Lajos Soukup  1

1 Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences 
@article{10_37236_3028,
     author = {Istv\'an Mikl\'os and P\'eter L Erd\H{o}s and Lajos Soukup},
     title = {Towards random uniform sampling of bipartite graphs with given degree sequence},
     journal = {The electronic journal of combinatorics},
     year = {2013},
     volume = {20},
     number = {1},
     doi = {10.37236/3028},
     zbl = {1266.05155},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/3028/}
}
TY  - JOUR
AU  - István Miklós
AU  - Péter L Erdős
AU  - Lajos Soukup
TI  - Towards random uniform sampling of bipartite graphs with given degree sequence
JO  - The electronic journal of combinatorics
PY  - 2013
VL  - 20
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/3028/
DO  - 10.37236/3028
ID  - 10_37236_3028
ER  - 
%0 Journal Article
%A István Miklós
%A Péter L Erdős
%A Lajos Soukup
%T Towards random uniform sampling of bipartite graphs with given degree sequence
%J The electronic journal of combinatorics
%D 2013
%V 20
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/3028/
%R 10.37236/3028
%F 10_37236_3028
István Miklós; Péter L Erdős; Lajos Soukup. Towards random uniform sampling of bipartite graphs with given degree sequence. The electronic journal of combinatorics, Tome 20 (2013) no. 1. doi: 10.37236/3028

Cité par Sources :