Towards random uniform sampling of bipartite graphs with given degree sequence

Details Towards random uniform sampling of bipartite graphs with given degree sequence Towards random uniform sampling of bipartite graphs with given degree sequence

2010-04-15

arxiv.org/abs/1004.2612v3

Mathematics

Combinatorics

35 pages, submitted for publication. In this version we explain explicitly our main contribution

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Towards random uniform sampling of bipartite graphs with given degree sequence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Towards random uniform sampling of bipartite graphs with given degree sequence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards random uniform sampling of bipartite graphs with given degree sequence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-380026