Parameter testing in bounded degree graphs of subexponential growth

We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset $ {\cal S} $ of the nonnegative integers. Subject to a certain hypothesis on $ {\cal S} $, the empirical distribution of the vertex degrees is asymptotically Poisson with some parameter $ \hat{\mu} $ given as the root of a certain “characteristic equation” of $ {\cal S} $ that maximizes a certain function $ {\psi_{\cal S}(\mu)} $. Subject to a hypothesis on $ {\cal 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 $ {\cal S} $ including the sets of (respectively) even and odd numbers. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010

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

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

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

[4]  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.

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

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

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

[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.  Random Graphs: Notation , 2001 .

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

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

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

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

[14]  Svante Janson,et al.  Random Even Graphs , 2007, Electron. J. Comb..

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

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

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

[18]  Svante Janson,et al.  A new approach to the giant component problem , 2007, Random Struct. Algorithms.

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

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