Simon model

In applied probability theory, the Simon model is a class of stochastic models that results in a power-law distribution function. It was proposed by Herbert A. Simon[1] to account for the wide range of empirical distributions following a power-law. 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 ${\displaystyle 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.

Description

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

(i) With probability ${\displaystyle \alpha }$ add a new node and attach a link to it from an arbitrarily chosen node.

(ii) With probability ${\displaystyle 1-\alpha }$ add one link from an arbitrary node to a node ${\displaystyle j}$ of class ${\displaystyle [k]}$ chosen with a probability proportional to ${\displaystyle kf(k)}$.

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

Properties

(i) Barabási-Albert (BA) model can be mapped to the subclass ${\displaystyle \alpha =1/2}$ of Simon's model, when using the simpler probability for a node being connected to another node ${\displaystyle i}$ with connectivity ${\displaystyle k_{i}}$ ${\displaystyle P(\mathrm {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 ${\displaystyle \alpha }$ reflects the relative growth of number of nodes versus the number of links. In general ${\displaystyle \alpha }$ has small values; therefore, the scaling exponents can be predicted to be ${\displaystyle \gamma \approx 2}$. For instance, Bornholdt and Ebel[2] studied the linking dynamics of World Wide Web, and predicted the scaling exponent as ${\displaystyle \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]

See also

• Price's model

References

1. Simon, Herbert A. (1955). "On a Class of Skew Distribution Functions". Biometrika. 42 (3–4). Oxford University Press (OUP): 425–440. doi:10.1093/biomet/42.3-4.425. ISSN 0006-3444.
2. Bornholdt, Stefan; Ebel, Holger (2001-08-27). "World Wide Web scaling exponent from Simon's 1955 model". Physical Review E. 64 (3). American Physical Society (APS): 035104(R). arXiv:cond-mat/0008465. Bibcode:2001PhRvE..64c5104B. doi:10.1103/physreve.64.035104. ISSN 1063-651X. PMID 11580377. S2CID 2582211.
3. Albert, Réka; Barabási, Albert-László (2002-01-30). "Statistical mechanics of complex networks". Reviews of Modern Physics. 74 (1): 47–97. arXiv:cond-mat/0106096. Bibcode:2002RvMP...74...47A. doi:10.1103/revmodphys.74.47. ISSN 0034-6861. S2CID 60545.
4. Amaral, L. A. N.; Scala, A.; Barthelemy, M.; Stanley, H. E. (2000-09-26). "Classes of small-world networks". Proceedings of the National Academy of Sciences USA. 97 (21). Proceedings of the National Academy of Sciences: 11149–11152. arXiv:cond-mat/0001458. Bibcode:2000PNAS...9711149A. doi:10.1073/pnas.200327197. ISSN 0027-8424. PMC 17168. PMID 11005838.