Subgraphs of Dense Random Graphs with Specified Degrees

Let d = (d1, d2,. . ., dn) be a vector of non-negative integers with even sum. We prove some basic facts about the structure of a random graph with degree sequence d, including the probability of a given subgraph or induced subgraph. Although there are many results of this kind, they are restricted to the sparse case with only a few exceptions. Our focus is instead on the case where the average degree is approximately a constant fraction of n. Our approach is the multidimensional saddle-point method. This extends the enumerative work of McKay and Wormald (1990) and is analogous to the theory developed for bipartite graphs by Greenhill and McKay (2009).

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

[2]  Sebastiano Vigna,et al.  Lower bounds for sense of direction in regular graphs , 2003, Distributed Computing.

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

[4]  N. Wormald,et al.  Models of the , 2010 .

[5]  Benny Sudakov,et al.  Regular induced subgraphs of a random Graph , 2011, Random Struct. Algorithms.

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

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

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

[9]  Alan M. Frieze,et al.  Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number , 2002, Combinatorics, Probability and Computing.

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

[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.  Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity , 2002, Combinatorics, Probability and Computing.

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

[14]  N. Wormald.  Models of random regular graphs , 2010 .

[15]  Alexander I. Barvinok,et al.  The number of graphs and a random graph with a given degree sequence , 2010, Random Struct. Algorithms.

[16]  John D. Lamb,et al.  Surveys in combinatorics, 1999 , 1999 .

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

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

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

[20]  Benny Sudakov,et al.  Random regular graphs of high degree , 2001, Random Struct. Algorithms.

[21]  Brendan D. McKay,et al.  Random dense bipartite graphs and directed graphs with specified degrees , 2009, Random Struct. Algorithms.