Random evolution in massive graphs

Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by the so-called "power law." In this paper, we, examine three important aspects of power law graphs, (1) the evolution of power law graphs, (2) the asymmetry of in-degrees and out-degrees, (3) the "scale invariance" of power law graphs. In particular, we give three increasingly general directed graph models and one general undirected graph model for generating power law graphs by adding at most one node and possibly one or more edges at a time. We show that for any given edge density and desired power laws for in-degrees and out-degrees, not necessarily the same, the resulting graph will almost surely have the desired edge density and the power laws for the in-degrees and out-degrees. Our most general directed and undirected models include nearly all known power law evolution models as special cases. Finally, we show that our evolution models generate "scale invariant" graphs. We describe a method for scaling the time in our evolution model such that the power law of the degree sequences remains invariant.

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

[2]  George A. Miller,et al.  Length-Frequency Statistics for Written English , 1958, Inf. Control..

[3]  P. Erdos,et al.  On the strength of connectedness of a random graph , 1964 .

[4]  Z. K. Silagadze,et al.  Citations and the Zipf-Mandelbrot Law , 1999, Complex Syst..

[5]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[7]  H. Stanley,et al.  Modelling urban growth patterns , 1995, Nature.

[8]  B. M. Hill,et al.  Zipf's Law and Prior Distributions for the Composition of a Population , 1970 .

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

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

[11]  Larry J. Murphy,et al.  "Lotka's law in the humanities?" , 1973, J. Am. Soc. Inf. Sci..

[12]  G. Udny Yule,et al.  The statistical study of literary vocabulary , 1944 .

[13]  Juhan Tuldava,et al.  The Frequency Spectrum of Text and Vocabulary , 1996, J. Quant. Linguistics.

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

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

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

[17]  Andrzej K. Konopka,et al.  Oligonucleotide Frequencies in DNA Follow a Yule Distribution , 1996, Comput. Chem..

[18]  Robert A. Fairthorne.  Empirical hyperbolic distributions (Bradford-Zipf-Mandelbrot) for bibliometric description and prediction , 1969 .

[19]  Benoit B. Mandelbrot,et al.  Fractal Geometry of Nature , 1984 .

[20]  N. Wormald,et al.  Models of the , 2010 .

[21]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

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

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

[24]  Michael E. D. Koenig,et al.  Lotka's Law, Price's Urn, and Electronic Publishing , 1995, J. Am. Soc. Inf. Sci..

[25]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[26]  H. Simon,et al.  Models Of Man : Social And Rational , 1957 .

[27]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

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

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

[30]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

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

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

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

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

[35]  B. Bollobás.  The evolution of random graphs , 1984 .

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

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

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

[39]  Nicholas C. Wormald.  The asymptotic connectivity of labelled regular graphs , 1981, J. Comb. Theory, Ser. B.

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

[41]  Jeffery R. Westbrook,et al.  A Functional Approach to External Graph Algorithms , 1998, ESA.

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

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

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