Generating graphs uniformly at random

Generating Graphs Uniformly at Random. This paper deals with the problem of sampling from a uniform distribution on various classes of graphs of given size. We consider algorithms and restarting procedures for uniform generation of several kinds of trees, arbitrary unlabelled graphs and various kinds of labelled graphs. Most of the material discussed in this paper has been developed during the last decade by several authors. In section 4.3 some recent results on the generation of outerplanar graphs and maximal planar graphs are presented.

[1]  Mark Jerrum,et al.  Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved , 1988, STOC '88.

[2]  Brendan D. McKay,et al.  Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2) , 1991, Comb..

[3]  Martin E. Dyer,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.

[4]  K. L. McAvaney.  Combinatorial Mathematics VIII , 1982 .

[5]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[6]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[7]  C. Berge.  Graphes et hypergraphes , 1970 .

[8]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

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

[10]  Nicholas C. Wormald,et al.  Generating Random Unlabelled Graphs , 1987, SIAM J. Comput..

[11]  Ronald C. Read.  A survey of graph generation techniques , 1981 .

[12]  R. Read.  Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations , 1978 .

[13]  Frank Harary,et al.  Graph Theory , 2016 .

[14]  A. Nijenhuis.  Combinatorial algorithms , 1975 .

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

[16]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, WG.

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

[18]  A. Sinclair.  Randomised algorithms for counting and generating combinatorial structures , 1988 .

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

[20]  Charles J. Colbourn,et al.  Cataloguing the graphs on 10 vertices , 1985, J. Graph Theory.

[21]  Béla Bollobás,et al.  THE ASYMPTOTIC NUMBER OF UNLABELLED REGULAR GRAPHS , 1982 .

[22]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[23]  Herbert S. Wilf.  The Uniform Selection of Free Trees , 1981, J. Algorithms.

[24]  N. Sloane,et al.  Proof Techniques in Graph Theory , 1970 .

[25]  W. T. Tutte,et al.  A Census of Planar Triangulations , 1962, Canadian Journal of Mathematics.

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

[27]  Herbert S. Wilf,et al.  The Random Selection of Unlabeled Graphs , 1983, J. Algorithms.