Empirical validation of the buckley-osthus model for the web host graph: degree and edge distributions

We consider the Buckley-Osthus implementation of preferential attachment and its ability to model the web host graph in two aspects. One is the degree distribution that we observe to follow the power law, as often being the case for real-world graphs. Another one is the two-dimensional edge distribution, the number of edges between vertices of given degrees. We fit a single "initial attractiveness" parameter a of the model, first with respect to the degree distribution of the web host graph, and then, absolutely independently, with respect to the edge distribution. Surprisingly, the values of a we obtain turn out to be nearly the same. Therefore the same model with the same value of the parameter a fits very well the two independent and basic aspects of the web host graph. In addition, we demonstrate that other models completely lack the asymptotic behavior of the edge distribution of the web host graph, even when accurately capturing the degree distribution. To the best of our knowledge, this is the first study confirming the ability of preferential attachment models to reflect the distribution of edges between vertices with respect to their degrees in a real graph of Internet.

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

[2]  Milton Abramowitz,et al.  Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .

[3]  Deryk Osthus,et al.  Popularity based random graph models leading to a scale-free degree sequence , 2004, Discret. Math..

[4]  L. da F. Costa,et al.  Characterization of complex networks: A survey of measurements , 2005, cond-mat/0505185.

[5]  Béla Bollobás,et al.  The Diameter of a Scale-Free Random Graph , 2004, Comb..

[6]  M. Abramowitz,et al.  Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55) , 1965 .

[7]  Eli Upfal,et al.  The Web as a graph , 2000, PODS.

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

[9]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

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

[11]  Anthony Bonato,et al.  A Survey of Models of the Web Graph , 2004, CAAN.

[12]  Evgeny A. Grechnikov,et al.  Degree Distribution and Number of Edges between Nodes of Given Degrees in the Buckley–Osthus Model of a Random Web Graph , 2011, Internet Math..

[13]  Ravi Kumar,et al.  Discovering Large Dense Subgraphs in Massive Graphs , 2005, VLDB.

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

[15]  K. Sneppen,et al.  Specificity and Stability in Topology of Protein Networks , 2002, Science.

[16]  Dimosthenis Anagnostopoulos,et al.  A Simulation-Based Evaluation of an Exponential Growth Copying Model for the Web Graph , 2003, The Web Conference.

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

[18]  S. Redner,et al.  Organization of growing random networks. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Shilpa Chakravartula,et al.  Complex Networks: Structure and Dynamics , 2014 .

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

[21]  Vijay V. Raghavan,et al.  The Shape of the Web and Its Implications for Searching the Web , 2000 .

[22]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.

[23]  Albert,et al.  Topology of evolving networks: local events and universality , 2000, Physical review letters.

[24]  W. Greene,et al.  计量经济分析 = Econometric analysis , 2009 .

[25]  Mihaela Enachescu,et al.  Variations on Random Graph Models for the Web , 2001 .

[26]  Chris Arney,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

[27]  K. Sneppen,et al.  Detection of topological patterns in complex networks: correlation profile of the internet , 2002, cond-mat/0205379.

[28]  M. Newman,et al.  Origin of degree correlations in the Internet and other networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Beom Jun Kim,et al.  Growing scale-free networks with tunable clustering. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Andrei Z. Broder,et al.  Efficient pagerank approximation via graph aggregation , 2004, WWW Alt. '04.

[31]  Béla Bollobás,et al.  Directed scale-free graphs , 2003, SODA '03.

[32]  Béla Bollobás,et al.  Mathematical results on scale‐free random graphs , 2005 .

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

[34]  G. Caldarelli,et al.  Assortative model for social networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[35]  R. Tsien,et al.  Specificity and Stability in Topology of Protein Networks , 2022 .

[36]  R Pastor-Satorras,et al.  Dynamical and correlation properties of the internet. , 2001, Physical review letters.

[37]  Yi Liu,et al.  The powerrank web link analysis algorithm , 2004, WWW Alt. '04.

[38]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

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

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

[41]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .