World Wide Web scaling exponent from Simon’s 1955 model

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsPublished 27 August 2001Open access

Stefan Bornholdt, Holger Ebel

DOI10.1103/physreve.64.035104

Source URL

Citations132

View PDF

TL;DR

A simple and elegant model for scaling phenomena in general copy- and growth-processes as proposed by Simon in 1955 is recalled and when combined with an experimental measurement of network growth in the World Wide Web, this classical model is able to model the in-link dynamics and predicts the scaling exponent gamma=2.1 in accordance with observation.

Abstract

The statistical properties of the World Wide Web have attracted considerable attention recently since self-similar regimes were first observed in the scaling of its link structure. One characteristic quantity is the number of (in-)links k that point to a particular web page. Its probability distribution P(k) shows a pronounced power-law scaling P(k) approximately k(-gamma) that is not readily explained by standard random graph theory. Here, we recall a simple and elegant model for scaling phenomena in general copy- and growth-processes as proposed by Simon in 1955. When combined with an experimental measurement of network growth in the World Wide Web, this classical model is able to model the in-link dynamics and predicts the scaling exponent gamma=2.1 in accordance with observation.

Keywords

Computer SciencePhysics and Astronomy

ScienceEmergence of Scaling in Random Networks

36,366 Citations1999Albert-Ĺaszló Barabási, Réka Albert

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

View PDF

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsRandom graphs with arbitrary degree distributions and their applications

3,644 Citations2001M. E. J. Newman, Steven H. Strogatz +1 more

It is demonstrated that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.

View PDF

Computer NetworksGraph structure in the Web

2,760 Citations2000Andrei Broder, Ravi Kumar +6 more

The study of the web as a graph yields valuable insight into web algorithms for crawling, searching and community discovery, and the sociological phenomena which characterize its evolution.

BiometrikaON A CLASS OF SKEW DISTRIBUTION FUNCTIONS

2,442 Citations1955Herbert A. Simon

Physica A Statistical Mechanics and its ApplicationsMean-field theory for scale-free random networks

2,251 Citations1999Albert-Ĺaszló Barabási, Réka Albert +1 more

A mean-field method is developed to predict the growth dynamics of the individual vertices of the scale-free model, and this is used to calculate analytically the connectivity distribution and the scaling exponents.

View PDF

Physical Review LettersTopology of Evolving Networks: Local Events and Universality

1,322 Citations2000Réka Albert, Albert-Ĺaszló Barabási

A continuum theory is proposed that predicts the connectivity distribution of the network describing the professional links between movie actors as well as the scaling function and the exponents, in good agreement with numerical results.

View PDF

Physical Review LettersStructure of Growing Networks with Preferential Linking

1,307 Citations2000S. N. Dorogovt︠s︡ev, J. F. F. Mendes +1 more

The model of growing networks with the preferential attachment of new links is generalized to include initial attractiveness of sites and it is shown that the relation beta(gamma-1) = 1 between the exponents is universal.

View PDF

The Economic JournalHuman Behaviour and the Principle of Least Effort.

1,196 Citations1950P. Sargant Florence, G. K. Zipf

Physical Review LettersConnectivity of Growing Random Networks

1,180 Citations2000P. L. Krapivsky, S. Redner +1 more

A solution for the time- and age-dependent connectivity distribution of a growing random network is presented and the power law N(k) approximately k(-nu) is found, where the exponent nu can be tuned to any value in the range 2.

View PDF

SciencePower-Law Distribution of the World Wide Web

1,018 Citations2000Lada A. Adamic, Bernardo A. Huberman

An improved version of the Erdos-Renyi (ER) theory of random networks is proposed to account for the scaling properties of a number of systems, including the link structure of the World Wide Web.