Random dense bipartite graphs and directed graphs with specified degrees

Let s and t be vectors of positive integers with the same sum. We study the uniform distribution on the space of simple bipartite graphs with degree sequence s in one part and t in the other; equivalently, binary matrices with row sums s and column sums t. In particular, we find precise formulae for the probabilities that a given bipartite graph is edge-disjoint from, a subgraph of, or an induced subgraph of a random graph in the class. We also give similar formulae for the uniform distribution on the set of simple directed graphs with out-degrees s and in-degrees t. In each case, the graphs or digraphs are required to be sufficiently dense, with the degrees varying within certain limits, and the subgraphs are required to be sufficiently sparse. Previous results were restricted to spaces of sparse graphs. Our theorems are based on an enumeration of bipartite graphs avoiding a given set of edges, proved by multidimensional complex integration. As a sample application, we determine the expected permanent of a random binary matrix with row sums s and column sums t. © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009

[1]  Brendan D. McKay,et al.  Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums , 2005, Electron. J. Comb..

[2]  A. Barvinok.  On the number of matrices and a random matrix with prescribed row and column sums and 0–1 entries☆ , 2008, 0806.1480.

[3]  Brendan D. McKay,et al.  The number of matchings in random regular graphs and bipartite graphs , 1986, J. Comb. Theory, Ser. B.

[4]  Brendan D. McKay,et al.  Subgraphs of random graphs with specified degrees , 2011 .

[5]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

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

[7]  Brendan D. McKay,et al.  Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph , 2000, Random Struct. Algorithms.

[8]  Xiaoji Wang,et al.  Asymptotic enumeration of Eulerian digraphs with multiple edges , 1992, Australas. J Comb..

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

[10]  Brendan D. McKay,et al.  Asymptotic enumeration of 0–1 matrices with equal row sums and equal column sums , 2003 .

[11]  Brendan D. McKay,et al.  Asymptotic enumeration of dense 0-1 matrices with specified line sums , 2008, J. Comb. Theory, Ser. A.

[12]  Alan M. Frieze,et al.  Hamilton Cycles in Random Regular Digraphs , 1994, Combinatorics, Probability and Computing.

[13]  Edward A. Bender,et al.  The asymptotic number of non-negative integer matrices with given row and column sums , 1974, Discret. Math..

[14]  N. Wormald.  Some problems in the enumeration of labelled graphs , 1980, Bulletin of the Australian Mathematical Society.

[15]  Brendan D. McKay,et al.  Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums , 2006, J. Comb. Theory, Ser. A.

[16]  Leonid Gurvits,et al.  Van der Waerden/Schrijver-Valiant like Conjectures and Stable (aka Hyperbolic) Homogeneous Polynomials: One Theorem for all , 2007, Electron. J. Comb..

[17]  Brendan D. McKay,et al.  Asymptotic Enumeration of Eulerian Circuits in the Complete Graph , 1998, Combinatorics, Probability and Computing.