Coupling Online and Offline Analyses for Random Power Law Graphs

We develop a coupling technique for analyzing online models by using offline models. This method is especially effective for a growth-deletion model that generalizes and includes the preferential attachment model for generating large complex networks which simulate numerous realistic networks. By coupling the online model with the offline model for random power law graphs, we derive strong bounds for a number of graph properties including diameter, average distances, connected components, and spectral bounds. For example, we prove that a power law graph generated by the growth-deletion model almost surely has diameter O(log n) and average distance O(log log n).

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

[2]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[3]  Fan Chung Graham,et al.  The Spectra of Random Graphs with Given Expected Degrees , 2004, Internet Math..

[4]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

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

[6]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .

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

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

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

[10]  Russell C. Coile,et al.  Lotka's frequency distribution of scientific productivity , 1977, J. Am. Soc. Inf. Sci..

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

[12]  Colin Cooper,et al.  Random Vertex Deletion in a Scale Free Random Graph , 2004 .

[13]  Van H. Vu,et al.  Concentration of Multivariate Polynomials and Its Applications , 2000, Comb..

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

[15]  Alan M. Frieze,et al.  A General Model of Undirected Web Graphs , 2001, ESA.

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

[17]  F. Chung,et al.  The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[18]  C. McDiarmid.  Concentration , 1862, The Dental register.

[19]  Alfred J. Lotka,et al.  The frequency distribution of scientific productivity , 1926 .

[20]  Fan Chung Graham,et al.  A Random Graph Model for Power Law Graphs , 2001, Exp. Math..

[21]  Béla Bollobás,et al.  Robustness and Vulnerability of Scale-Free Random Graphs , 2004, Internet Math..

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

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

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

[25]  Michael Mitzenmacher,et al.  A Brief History of Generative Models for Power Law and Lognormal Distributions , 2004, Internet Math..