User:Nurbudapest/sandbox/The Bianconi-Barabási model
This is not a Wikipedia article: It is an individual user's work-in-progress page, and may be incomplete and/or unreliable. For guidance on developing this draft, see Wikipedia:So you made a userspace draft. Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
The Bianconi-Barabási model is a model in Network Science which explains the growth of complex networks and also can generate a complex network. This model is named after Ginestra Bianconi and Albert-László Barabási. This model is a variant of the Barabási–Albert model.
Concepts
[edit]The Barabási–Albert (BA) model uses two concepts growth and preferential attachment, the Bianconi-Barabási model uses these two and another fitness parameter.
The Bianconi-Barabási model uses an analogy with evolutionary models. This model assigns an intrinsic fitness value to each node which embodies all the properties other than the degree [1]. The higher the fitness the higher the probability of attracting new edges.
While the Barabási–Albert (BA) model explains the first mover advantage but Bianconi-Barabási model explains how late comers can also win. In a network, where fitness is an attribute, a node with higher fitness will acquire links at a higher rate than less fit nodes. This model explains that age is not the best predictor of a node's success, late comers also have chance to attract links.
The Bianconi-Barabási model can reproduce the degree correlations of the Internet Autonomous Systems [2]. This model can also show condensation phase transitions in the evolution of complex network [3].
Algorithm
[edit]The fitness network begins with a fix number of interconnected nodes. As they have different fitness which can be described with fitness parameter, which is chosen from a fitness distribution ρ(η).
Growth
[edit]Here assumption is that a node’s fitness is independent of time and fixed. If a new node j with m links and a fitness is added with each time-step.
Preferential Attachment
[edit]The probability Πi that a new node connects to one of existing links to a node i in the network depends on the number of edges, , and on the fitness of node i, such that,
Properties
[edit]Equal Fitnesses
[edit]If all fitnesses are equal in a fitness network the Bianconi-Barabási model becomes the Barabási-Albert model.
The probability that the new node is connected to node is :
Here is the degree of node .
Uniform Fitness Distribution
[edit]The degree distribution
[edit]The degree distribution of the Bianconi-Barabási model depends on the fitness distribution ρ(η). There are two scenarios that can happen based on the probability distribution. If the fitness distribution has a finite domain then just like BA model degree distribution will have a power-law. In second case, if the fitness distribution has an infinite domain then a nodes with highest fitness value will attract large number of nodes and show a winners-take-all scenario [5].
History
[edit]In 1999, Albert-László Barabási requested his student Bianconi to investigate evolving network where nodes have a fitness parameter. Barabási was interested in finding out how Google a late comer in the search engine market became a top player. Bianconi's work showed that when fitness parameter is present "early bird" is not always the winner [6].
In 2001 Ginestra Bianconi and Albert-László Barabási in Europhysics Letters published this model [7].
See also
[edit]References
[edit]- ^ Pastor-Satorras, Romualdo; Vespignani, Alessandro (2007). Evolution and structure of the Internet: A statistical physics approach (1st ed.). Cambridge University Press. p. 100.
- ^ Vázquez, Alexei; Pastor-Satorras,, Romualdo; Vespignani., Alessandro (2002). "Large-scale topological and dynamical properties of the Internet". Physical Review E.
{{cite journal}}
: CS1 maint: extra punctuation (link) - ^ Su, Guifeng; Xiaobing, Zhang; Zhang, Yi (2012). "Condensation phase transition in nonlinear fitness networks". EPL (Europhysics Letters).
{{cite journal}}
:|access-date=
requires|url=
(help) - ^ Guanrong, Chen; Xiaofan, Wang; Xiang, Li (2014). Fundamentals of Complex Networks: Models, Structures and Dynamics. p. 200.
- ^ Guanrong, Chen; Xiaofan, Wang; Xiang, Li (2014). Fundamentals of Complex Networks: Models, Structures and Dynamics. p. 126.
- ^ Barabási, Albert-László (2002). Linked: The New Science of Networks. Perseus Books Group. p. 97.
- ^ Bianconi, Ginestra; Barabási, Albert-László (2001). "Competition and multiscaling in evolving networks". Europhysics Letters.
{{cite journal}}
:|access-date=
requires|url=
(help)
External links
[edit]