Simon model

From Wikipedia, the free encyclopedia

The introduction to this article provides insufficient context for those unfamiliar with the subject.
Please help improve the article with a good introductory style.

1 Motivation
2 Description
3 Properties
4 References

[edit] Motivation

Aiming to account for the wide range of empirical distributions following a power-law, Herbert Simon^[1] proposed a class of stochastic models that results in a power-law distribution function. It models the dynamics of a system of elements with associated counters (e.g., words and their frequencies in texts, or nodes in a network and their connectivity $k$ ). In this model the dynamics of the system is based on constant growth via addition of new elements (new instances of words) as well as incrementing the counters (new occurrences of a word) at a rate proportional to their current values.

[edit] Description

To model this type of network growth as described above, Bornholdt and Ebel^[2] considered a network with $n$ nodes, and each node with connectivities $k i$ , $i = 1 \ldots n$ . These nodes form classes $[k]$ of $f (k)$ nodes with identical connectivity $k$ . Repeat the following steps:

(i) With probability $α$ add a new node and attach a link to it from an arbitrarily chosen node.

(ii) With probability $1 - α$ add one link from an arbitrary node to a node $j$ of class $[k]$ chosen with probability $P_{new\ link\ to\ class\ [k]} \propto k f(k)$ .

For this stochastic process, Simon found a stationary solution exhibiting power-law scaling, $P(k) \propto k^{- \gamma}$ , with exponent $\gamma = 1 + \frac{1}{1- \alpha}.$

[edit] Properties

(i) Barabási-Albert (BA) model can be mapped to the subclass $α = 1 / 2$ of Simon's model, when using the simpler probability for a node being connected to another node $i$ with connectivity $k i$ $P_{new\ link\ to\ i} \propto k_i$ (same as the preferential attachment at BA Model). In other words, the Simon model describes a general class of stochastic processes that can result in a scale-free network, appropriate to capture Pareto and Zipf's laws.

(ii) The only free parameter of the model $α$ reflects the relative growth of number of nodes versus the number of links. In general $α$ has small values; therefore, the scaling exponents can be predicted to be $\gamma\approx 2$ . For instance, Bornholdt and Ebel^[2] studied the linking dynamics of World Wide Web, and predicted the scaling exponent as $\gamma \approx 2.1$ , which was consistent with observation.

(iii) The interest in the scale-free model comes from its ability to describe the topology of complex networks. The Simon model does not have an underlying network structure, as it was designed to describe events whose frequency follows a power-law. Thus network measures going beyond the degree distribution such as the average path length, spectral properties, and clustering coefficient, cannot be obtained from this mapping.

The Simon model is related to generalized scale-free models with growth and preferential attachment properties. For more reference, see ^[3]^[4].

[edit] References

^ Simon, H. A., 1955, Biometrika 42, 425.
^ ^a ^b Bornholdt, S. and H. Ebel, Phys. Rev. E 64 (2001) 035104(R).
^ Barabási, A.-L., and R. Albert, Statistical mechanics of complex networks, Reviews of Modern Physics, Vol 74, page 47-97, 2002.
^ Amaral, L. A. N., A. Scala, M. Barthelemy, and H. E. Stanley, 2000, Proc. Natl. Acad. Sci. U.S.A. 97, 11149.