Simon Model
   HOME

TheInfoList



OR:

In applied probability theory, the Simon model is a class of
stochastic model In probability theory and related fields, a stochastic () or random process is a mathematical object usually defined as a family of random variables in a probability space, where the index of the family often has the interpretation of time. Stoc ...
s that results in a
power-law In statistics, a power law is a functional relationship between two quantities, where a relative change in one quantity results in a relative change in the other quantity proportional to the change raised to a constant exponent: one quantity var ...
distribution function. It was proposed by
Herbert A. Simon Herbert Alexander Simon (June 15, 1916 – February 9, 2001) was an American scholar whose work influenced the fields of computer science, economics, and cognitive psychology. His primary research interest was decision-making within organi ...
to account for the wide range of empirical
distributions Distribution may refer to: Mathematics *Distribution (mathematics), generalized functions used to formulate solutions of partial differential equations *Probability distribution, the probability of a particular value or value range of a varia ...
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 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 considered a network with n nodes, and each node with connectivities k_i, i = 1, \ldots, n. These nodes form classes /math> of f(k) nodes with identical connectivity k. Repeat the following steps: (i) With probability \alpha add a new node and attach a link to it from an arbitrarily chosen node. (ii) With probability 1-\alpha add one link from an arbitrary node to a node j of class /math> chosen with a probability proportional to k f(k). For this stochastic process, Simon found a stationary solution exhibiting
power-law In statistics, a power law is a functional relationship between two quantities, where a relative change in one quantity results in a relative change in the other quantity proportional to the change raised to a constant exponent: one quantity var ...
scaling, P(k) \propto k^, with exponent \gamma = 1 + \frac.


Properties

(i) Barabási-Albert (BA) model can be mapped to the subclass \alpha= 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(\mathrm 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 A scale-free network is a network whose degree distribution follows a power law, at least asymptotically. That is, the fraction ''P''(''k'') of nodes in the network having ''k'' connections to other nodes goes for large values of ''k'' as : P( ...
, appropriate to capture Pareto and Zipf's laws. (ii) The only free parameter of the model \alpha reflects the relative growth of number of nodes versus the number of links. In general \alpha has small values; therefore, the scaling exponents can be predicted to be \gamma\approx 2. For instance, Bornholdt and Ebel 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 In statistics, a power law is a functional relationship between two quantities, where a relative change in one quantity results in a relative change in the other quantity proportional to the change raised to a constant exponent: one quantity var ...
. Thus network measures going beyond the
degree distribution In the study of graphs and networks, the degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability distribution of these degrees over the whole network. Definition The degr ...
such as the
average path length Average path length, or average shortest path length is a concept in network topology that is defined as the average number of steps along the shortest paths for all possible pairs of network nodes. It is a measure of the efficiency of informati ...

spectral properties
and
clustering coefficient In graph theory, a clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. Evidence suggests that in most real-world networks, and in particular social networks, nodes tend to create tightly knit groups ...
, 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.{{cite journal , last1=Amaral , first1=L. A. N. , last2=Scala , first2=A. , last3=Barthelemy , first3=M. , last4=Stanley , first4=H. E. , title=Classes of small-world networks , journal=Proceedings of the National Academy of Sciences USA , publisher=Proceedings of the National Academy of Sciences , volume=97 , issue=21 , date=2000-09-26 , issn=0027-8424 , doi=10.1073/pnas.200327197 , pages=11149–11152, pmid=11005838 , pmc=17168 , arxiv=cond-mat/0001458 , bibcode=2000PNAS...9711149A , doi-access=free


See also

* Price's model


References

Power laws Networks