Expand and Contract: Sampling graphs with given degrees and other combinatorial families

Sampling from combinatorial families can be difficult. However, complicated families can often be embedded within larger, simpler ones, for which easy sampling algorithms are known. We take advantage of such a relationship to describe a sampling algorithm for the smaller family, via a Markov chain started at a random sample of the larger family. The utility of the method is demonstrated via several examples, with particular emphasis on sampling labelled graphs with given degree sequence, a well-studied problem for which existing algorithms leave much room for improvement. For graphs with given degrees, with maximum degree $O(m^{1/4})$ where $m$ is the number of edges, we obtain an asymptotically uniform sample in $O(m)$ steps, which substantially improves upon existing algorithms.

[1]  Arnaud Doucet,et al.  Sequential Monte Carlo Methods , 2006, Handbook of Graphical Models.

[2]  Allan Sly,et al.  Random graphs with a given degree sequence , 2010, 1005.1136.

[3]  D. Landau,et al.  Efficient, multiple-range random walk algorithm to calculate the density of states. , 2000, Physical review letters.

[4]  Persi Diaconis,et al.  A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees , 2011, Internet Math..

[5]  P. Diaconis,et al.  The Subgroup Algorithm for Generating Uniform Random Variables , 1987, Probability in the Engineering and Informational Sciences.

[6]  J. Blanchet.  Efficient importance sampling for binary contingency tables , 2009, 0908.0999.

[7]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

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

[9]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[10]  Eric Vigoda,et al.  Negative Examples for Sequential Importance Sampling of Binary Contingency Tables , 2011, Algorithmica.

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

[12]  Van H. Vu,et al.  Generating Random Regular Graphs , 2003, STOC '03.

[13]  P. Diaconis,et al.  HIT AND RUN AS A UNIFYING DEVICE , 2007 .

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

[15]  Yuguo Chen,et al.  Sequential Monte Carlo Methods for Statistical Analysis of Tables , 2005 .

[16]  G. Parisi,et al.  Simulated tempering: a new Monte Carlo scheme , 1992, hep-lat/9205018.

[17]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[18]  Amin Saberi,et al.  A Sequential Algorithm for Generating Random Graphs , 2007, Algorithmica.

[19]  Neal Madras,et al.  On the swapping algorithm , 2003, Random Struct. Algorithms.

[20]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[21]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[22]  T. C. Hu,et al.  Combinatorial algorithms , 1982 .

[23]  Macoto Kikuchi,et al.  Numerous but Rare: An Exploration of Magic Squares , 2015, PloS one.

[24]  Nicholas C. Wormald,et al.  Generating Random Regular Graphs Quickly , 1999, Combinatorics, Probability and Computing.

[25]  Guy Louchard,et al.  Boltzmann Samplers for the Random Generation of Combinatorial Structures , 2004, Combinatorics, Probability and Computing.

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

[27]  Eric Vigoda,et al.  Sampling binary contingency tables with a greedy start , 2006, SODA '06.

[28]  Igor Pak,et al.  WHEN AND HOW n CHOOSE k , 1997 .