Random graphs with forbidden vertex degrees

We study the random graph G_{n,\lambda/n} conditioned on the event that all vertex degrees lie in some given subset S of the non-negative integers. Subject to a certain hypothesis on S, the empirical distribution of the vertex degrees is asymptotically Poisson with some parameter \mux given as the root of a certain `characteristic equation' of S that maximises a certain function \psis(\mu). Subject to a hypothesis on S, we obtain a partial description of the structure of such a random graph, including a condition for the existence (or not) of a giant component. The requisite hypothesis is in many cases benign, and applications are presented to a number of choices for the set S including the sets of (respectively) even and odd numbers. The random \emph{even} graph is related to the random-cluster model on the complete graph K_n.

[1]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[2]  T. Lindvall.  Lectures on the Coupling Method , 1992 .

[3]  Oliver Riordan,et al.  The k-Core and Branching Processes , 2005, Combinatorics, Probability and Computing.

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

[5]  Svante Janson,et al.  The Birth of the Giant Component , 1993, Random Struct. Algorithms.

[6]  Geoffrey Grimmett.  The Random-Cluster Model , 2002, math/0205237.

[7]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

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

[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]  Svante Janson,et al.  A new approach to the giant component problem , 2007, Random Struct. Algorithms.

[11]  R. Bass,et al.  Review: P. Billingsley, Convergence of probability measures , 1971 .

[12]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[13]  R. Arratia,et al.  Logarithmic Combinatorial Structures: A Probabilistic Approach , 2003 .

[14]  Svante Janson,et al.  A simple solution to the k-core problem , 2007, Random Struct. Algorithms.

[15]  Nicholas C. Wormald,et al.  The asymptotic distribution of short cycles in random regular graphs , 1981, J. Comb. Theory, Ser. B.

[16]  Svante Janson.  The Probability That a Random Multigraph is Simple , 2009, Comb. Probab. Comput..

[17]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[18]  Svante Janson,et al.  Random even graphs and the Ising model , 2007 .

[19]  Joel H. Spencer,et al.  Sudden Emergence of a Giantk-Core in a Random Graph , 1996, J. Comb. Theory, Ser. B.