Robustness of the in-degree exponent for the World-Wide Web.

We consider a stochastic model for directed scale-free networks following power laws in the degree distributions in both incoming and outgoing directions. In our model, the number of vertices grow geometrically with time with a growth rate p. At each time step, (i) each newly introduced vertex is connected to a constant number of already existing vertices with the probability linearly proportional to in-degree distribution of a selected vertex, and (ii) each existing vertex updates its outgoing edges through a stochastic multiplicative process with mean growth rate of outgoing edges g and its variance sigma(2). Using both analytic treatment and numerical simulations, we show that while the out-degree exponent gamma(out) depends on the parameters, the in-degree exponent gamma(in) has two distinct values, gamma(in)=2 for p>g and 1 for p<g, independent of different parameters values. The latter case has logarithmic correction to the power law. Since the vertex growth rate p is larger than the degree growth rate g for the World-Wide Web (WWW) nowadays, the in-degree exponent appears robust as gamma(in)=2 for the WWW.

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

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

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

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

[5]  B. Tadić Dynamics of directed graphs: the world-wide Web , 2000, cond-mat/0011442.

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

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

[8]  S Redner,et al.  Degree distributions of growing networks. , 2001, Physical review letters.

[9]  S. Redner How popular is your paper? An empirical study of the citation distribution , 1998, cond-mat/9804163.

[10]  K-I Goh,et al.  Fluctuation-driven dynamics of the internet topology. , 2002, Physical review letters.

[11]  Ginestra Bianconi,et al.  Competition and multiscaling in evolving networks , 2001 .

[12]  Goldenfeld,et al.  Simple lessons from complexity , 1999, Science.

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

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

[15]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

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

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

[18]  S. Strogatz Exploring complex networks , 2001, Nature.

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

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