A General Model of Undirected Web Graphs

We describe a general model of a random graph process whose degree sequence obeys a power law. Such laws have recently been observed in graphs associated with the world wide web.

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

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

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

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

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

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

[7]  Micah Adler,et al.  Towards compressing Web graphs , 2001, Proceedings DCC 2001. Data Compression Conference.

[8]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

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

[10]  G. Pólya,et al.  Problems and theorems in analysis , 1983 .

[11]  L. M. Milne-Thomson,et al.  The Calculus Of Finite Differences , 1934 .

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

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

[14]  Colin Macilwain.  Clinton flails congress over $1.8 billion civilian R&D cuts , 1999, Nature.