Connected Components in Random Graphs with Given Expected Degree Sequences

Abstract. We consider a family of random graphs with a given expected degree sequence. Each edge is chosen independently with probability proportional to the product of the expected degrees of its endpoints. We examine the distribution of the sizes/volumes of the connected components which turns out depending primarily on the average degree d and the second-order average degree d~. Here d~ denotes the weighted average of squares of the expected degrees. For example, we prove that the giant component exists if the expected average degree d is at least 1, and there is no giant component if the expected second-order average degree d~ is at most 1. Examples are given to illustrate that both bounds are best possible.

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

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

[3]  Béla Bollobás,et al.  Random Graphs , 1985 .

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

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

[6]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[7]  Ellen W. Zegura,et al.  A quantitative comparison of graph-based models for Internet topology , 1997, TNET.

[8]  N. Gilbert.  A Simulation of the Structure of Academic Science , 1997 .

[9]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

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

[11]  M. Habib.  Probabilistic methods for algorithmic discrete mathematics , 1998 .

[12]  Ravi Kumar,et al.  Extracting Large-Scale Knowledge Bases from the Web , 1999, VLDB.

[13]  Lada A. Adamic,et al.  Internet: Growth dynamics of the World-Wide Web , 1999, Nature.

[14]  Jon M. Kleinberg,et al.  The Web as a Graph: Measurements, Models, and Methods , 1999, COCOON.

[15]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[16]  Ravi Kumar,et al.  Trawling the Web for Emerging Cyber-Communities , 1999, Comput. Networks.

[17]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[18]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[19]  F. Chung,et al.  The Diameter of Random Sparse Graphs , 2000 .

[20]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

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

[22]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[23]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .

[24]  Eli Upfal,et al.  Stochastic models for the Web graph , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[25]  S. Krishna,et al.  A model for the emergence of cooperation, interdependence, and structure in evolving networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[26]  R. B. Azevedo,et al.  A power law for cells , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[27]  Fan Chung Graham,et al.  Random evolution in massive graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[28]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[29]  Linyuan Lu,et al.  The diameter of random massive graphs , 2001, SODA '01.

[30]  Fan Chung Graham,et al.  The Diameter of Sparse Random Graphs , 2001, Adv. Appl. Math..

[31]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

[32]  F. Chung,et al.  Eigenvalues of Random Power law Graphs , 2003 .

[33]  Alan M. Frieze,et al.  A general model of web graphs , 2003, Random Struct. Algorithms.