Simple Markov-chain algorithms for generating bipartite graphs and tournaments

We consider two problems: randomly generating labeled bipartite graphs with a given degree sequence and randomly generating labeled tournaments with a given score sequence. We analyze simple Markov chains for both problems. For the first problem, we cannot prove that our chain is rapidly mixing in general, but in the (near-) regular case, i.e. when all the degrees are (almost) equal, we give a proof of rapid mixing. Our methods also apply to the corresponding problem for general (nonbipartite) regular graphs which was studied earlier by several researchers. One significant difference in our approach is that our chain has one state for every graph (or bipartite graph) with the given degree sequence; in particular, there are no auxiliary states as in the chain used by Jerrum and Sinclair. For the problem of generating tournaments, we are able to prove that our Markov chain on tournaments is rapidly mixing, if the score sequence is near-regular. The proof techniques we use for the two problems are similar.

[1]  Mark Jerrum,et al.  Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..

[2]  Brendan D. McKay,et al.  Asymptotic Enumeration of Tournaments with a Given Score Sequence , 1996, J. Comb. Theory A.

[3]  Mark Jerrum,et al.  Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract) , 1990, ICALP.

[4]  Nicholas C. Wormald,et al.  Generating Random Regular Graphs , 1984, J. Algorithms.

[5]  Mark Jerrum,et al.  Fast Uniform Generation of Regular Graphs , 1990, Theor. Comput. Sci..

[6]  J. Moon.  Topics on tournaments , 1968 .

[7]  P. Flajolet.  On approximate counting , 1982 .

[8]  Brendan D. McKay,et al.  Asymptotic Enumeration by Degree Sequence of Graphs of High Degree , 1990, Eur. J. Comb..

[9]  D. Gale.  A theorem on flows in networks , 1957 .

[10]  Martin E. Dyer,et al.  Sampling contingency tables , 1997, Random Struct. Algorithms.

[11]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, International Workshop on Graph-Theoretic Concepts in Computer Science.

[12]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[13]  Brendan D. McKay,et al.  Uniform Generation of Random Regular Graphs of Moderate Degree , 1990, J. Algorithms.

[14]  H. Landau.  On dominance relations and the structure of animal societies: III The condition for a score structure , 1953 .

[15]  Brendan D. McKay,et al.  The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs , 1990, Comb..

[16]  D. R. Fulkerson.  UPSETS IN ROUND ROBIN TOURNAMENTS , 1965 .

[17]  H. G. Landau,et al.  On dominance relations and the structure of animal societies: II. Some effects of possible social factors , 1951 .

[18]  Alistair Sinclair,et al.  Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.

[19]  Joel Spencer,et al.  Random regular tournaments , 1974 .