Duality in inhomogeneous random graphs, and the cut metric

The classical random graph model G(n, c/n) satisfies a “duality principle”, in that removing the giant component from a supercritical instance of the model leaves (essentially) a subcritical instance. Such principles have been proved for various models; they are useful since it is often much easier to study the subcritical model than to directly study small components in the supercritical model. Here we prove a duality principle of this type for a very general class of random graphs with independence between the edges, defined by convergence of the matrices of edge probabilities in the cut metric. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 39, 399–411, 2011 © 2011 Wiley Periodicals, Inc.

[1]  Tomasz Luczak,et al.  Component Behavior Near the Critical Point of the Random Graph Process , 1990, Random Struct. Algorithms.

[2]  Tomasz Łuczak.  Component behavior near the critical point of the random graph process , 1990 .

[3]  Noga Alon,et al.  The Probabilistic Method, Second Edition , 2004 .

[4]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[5]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[6]  B. Bollobás,et al.  Metrics for sparse graphs , 2007, 0708.1919.

[7]  Béla Bollobás,et al.  The Cut Metric, Random Graphs, and Branching Processes , 2009, 0901.2091.

[8]  Svante Janson,et al.  Susceptibility in Inhomogeneous Random Graphs , 2009, Electron. J. Comb..

[9]  Béla Bollobás,et al.  Sparse random graphs with clustering , 2008, Random Struct. Algorithms.

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

[11]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

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

[13]  C. Borgs,et al.  Percolation on dense graph sequences. , 2007, math/0701346.

[14]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[15]  Béla Bollobás,et al.  The phase transition in inhomogeneous random graphs , 2007, Random Struct. Algorithms.

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

[17]  Alan M. Frieze,et al.  Quick Approximation to Matrices and Applications , 1999, Comb..

[18]  V. Sós,et al.  Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.