Bianconi–Barabási model

Bose–Einstein Condensate: The Bianconi–Barabási model's fitness concept can be used to explain the Bose–Einstein condensate. Here the peaks show that as the temperature goes down, more and more atoms condense to the same energy level. At lower temperature when the "fitness" is higher, this model predicts that more atoms will be connected to the same energy level.

The Bianconi–Barabási model is a model in network science that explains the growth of complex evolving networks. This model can explain that nodes with different characteristics acquire links at different rates. It predicts that a node's growth depends on its fitness and can calculate the degree distribution. The Bianconi–Barabási model ^[1]^[2] is named after its inventors Ginestra Bianconi and Albert-László Barabási. This model is a variant of the Barabási–Albert model. The model can be mapped to a Bose gas and this mapping can predict a topological phase transition between a "rich-get-richer" phase and a "winner-takes-all" phase.^[2]

Concepts

The Barabási–Albert (BA) model uses two concepts: growth and preferential attachment. Here, growth indicates the increase in the number of nodes in the network with time, and preferential attachment means that more connected nodes receive more links. The Bianconi–Barabási model,^[1] on top of these two concepts, uses another new concept called the fitness. This model makes use of an analogy with evolutionary models. It assigns an intrinsic fitness value to each node, which embodies all the properties other than the degree.^[3] The higher the fitness, the higher the probability of attracting new edges. Fitness can be defined as the ability to attract new links – "a quantitative measure of a node's ability to stay in front of the competition".^[4]

While the Barabási–Albert (BA) model explains the "first mover advantage" phenomenon, the Bianconi–Barabási model explains how latecomers also can 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, rather latecomers also have the chance to attract links to become a hub.

The Bianconi–Barabási model can reproduce the degree correlations of the Internet Autonomous Systems.^[5] This model can also show condensation phase transitions in the evolution of complex network.^[6]^[2] The BB model can predict the topological properties of Internet.^[7]

Algorithm

The fitness network begins with a fixed number of interconnected nodes. They have different fitness, which can be described with fitness parameter, [math]\displaystyle{ \eta_j }[/math] which is chosen from a fitness distribution [math]\displaystyle{ \rho(\eta) }[/math].

Growth

The assumption here is that a node’s fitness is independent of time, and is fixed. A new node j with m links and a fitness [math]\displaystyle{ \eta_j }[/math] is added with each time-step.

Preferential attachment

The probability [math]\displaystyle{ \Pi_i }[/math] that a new node connects to one of the existing links to a node [math]\displaystyle{ i }[/math] in the network depends on the number of edges, [math]\displaystyle{ k_{i} }[/math], and on the fitness [math]\displaystyle{ \eta_{i} }[/math] of node [math]\displaystyle{ i }[/math], such that,

[math]\displaystyle{ \Pi_i = \frac{\eta_i k_i}{\sum_j \eta_j k_j}. }[/math]

Each node’s evolution with time can be predicted using the continuum theory. If initial number of node is [math]\displaystyle{ m }[/math], then the degree of node [math]\displaystyle{ i }[/math] changes at the rate:

[math]\displaystyle{ \frac{\partial k_i}{\partial t} = m\frac{\eta_i k_i}{\sum_j \eta_j k_j} }[/math]

Assuming the evolution of [math]\displaystyle{ k_i }[/math] follows a power law with a fitness exponent [math]\displaystyle{ \beta(\eta_i) }[/math]

[math]\displaystyle{ k(t,t_i,\eta_i) = m\left(\frac{t}{t_i}\right)^{\beta(\eta_i)} }[/math],

where [math]\displaystyle{ t_i }[/math] is the time since the creation of node [math]\displaystyle{ i }[/math].

Here, [math]\displaystyle{ \beta(\eta) = \frac{\eta}{C}\text{ and }C = \int \rho(\eta)\frac{\eta}{1-\beta(\eta)} \, d\eta. }[/math]

Properties

Equal fitnesses

If all fitnesses are equal in a fitness network, the Bianconi–Barabási model reduces to the Barabási–Albert model, when the degree is not considered, the model reduces to the fitness model (network theory).

When fitnesses are equal, the probability [math]\displaystyle{ \Pi_i }[/math] that the new node is connected to node [math]\displaystyle{ i }[/math] when [math]\displaystyle{ k_i }[/math] is the degree of node [math]\displaystyle{ i }[/math] is,

[math]\displaystyle{ \Pi_i = \frac{k_i}{\sum_j k_j}. }[/math]

Degree distribution

Degree distribution of the Bianconi–Barabási model depends on the fitness distribution [math]\displaystyle{ \rho(\eta) }[/math]. There are two scenarios that can happen based on the probability distribution. If the fitness distribution has a finite domain, then the degree distribution will have a power-law just like the BA model. In the second case, if the fitness distribution has an infinite domain, then the node with the highest fitness value will attract a large number of nodes and show a winners-take-all scenario.^[8]

Measuring node fitnesses from empirical network data

There are various statistical methods to measure node fitnesses [math]\displaystyle{ \eta_i }[/math] in the Bianconi–Barabási model from real-world network data.^[9]^[10] From the measurement, one can investigate the fitness distribution [math]\displaystyle{ \rho(\eta) }[/math] or compare the Bianconi–Barabási model with various competing network models in that particular network.^[10]

Variations of the Bianconi–Barabási model

The Bianconi–Barabási model has been extended to weighted networks ^[11] displaying linear and superlinear scaling of the strength with the degree of the nodes as observed in real network data.^[12] This weighted model can lead to condensation of the weights of the network when few links acquire a finite fraction of the weight of the entire network.^[11] Recently it has been shown that the Bianconi–Barabási model can be interpreted as a limit case of the model for emergent hyperbolic network geometry ^[13] called Network Geometry with Flavor.^[14] The Bianconi–Barabási model can be also modified to study static networks where the number of nodes is fixed.^[15]

Bose-Einstein condensation

Bose–Einstein condensation in networks is a phase transition observed in complex networks that can be described by the Bianconi–Barabási model.^[1] This phase transition predicts a "winner-takes-all" phenomena in complex networks and can be mathematically mapped to the mathematical model explaining Bose–Einstein condensation in physics.

Background

In physics, a Bose–Einstein condensate is a state of matter that occurs in certain gases at very low temperatures. Any elementary particle, atom, or molecule, can be classified as one of two types: a boson or a fermion. For example, an electron is a fermion, while a photon or a helium atom is a boson. In quantum mechanics, the energy of a (bound) particle is limited to a set of discrete values, called energy levels. An important characteristic of a fermion is that it obeys the Pauli exclusion principle, which states that no two fermions may occupy the same state. Bosons, on the other hand, do not obey the exclusion principle, and any number can exist in the same state. As a result, at very low energies (or temperatures), a great majority of the bosons in a Bose gas can be crowded into the lowest energy state, creating a Bose–Einstein condensate.

Bose and Einstein have established that the statistical properties of a Bose gas are governed by the Bose–Einstein statistics. In Bose–Einstein statistics, any number of identical bosons can be in the same state. In particular, given an energy state $ε$ , the number of non-interacting bosons in thermal equilibrium at temperature $T = 1 / β$ is given by the Bose occupation number

[math]\displaystyle{ n(\varepsilon)=\frac{1}{e^{\beta(\varepsilon-\mu)}-1} }[/math]

where the constant $μ$ is determined by an equation describing the conservation of the number of particles

[math]\displaystyle{ N=\int d\varepsilon \, g(\varepsilon) \, n(\varepsilon) }[/math]

with $g (ε)$ being the density of states of the system.

This last equation may lack a solution at low enough temperatures when $g (ε) \to 0$ for $ε \to 0$ . In this case a critical temperature $T c$ is found such that for $T < T c$ the system is in a Bose-Einstein condensed phase and a finite fraction of the bosons are in the ground state.

The density of states $g (ε)$ depends on the dimensionality of the space. In particular [math]\displaystyle{ g(\varepsilon)\sim \varepsilon^{\frac{d-2}{2}} }[/math] therefore $g (ε) \to 0$ for $ε \to 0$ only in dimensions $d > 2$ . Therefore, a Bose-Einstein condensation of an ideal Bose gas can only occur for dimensions $d > 2$ .

The concept

The evolution of many complex systems, including the World Wide Web, business, and citation networks, is encoded in the dynamic web describing the interactions between the system’s constituents. The evolution of these networks is captured by the Bianconi-Barabási model, which includes two main characteristics of growing networks: their constant growth by the addition of new nodes and links and the heterogeneous ability of each node to acquire new links described by the node fitness. Therefore the model is also known as fitness model. Despite their irreversible and nonequilibrium nature, these networks follow the Bose statistics and can be mapped to a Bose gas. In this mapping, each node is mapped to an energy state determined by its fitness and each new link attached to a given node is mapped to a Bose particle occupying the corresponding energy state. This mapping predicts that the Bianconi–Barabási model can undergo a topological phase transition in correspondence to the Bose–Einstein condensation of the Bose gas. This phase transition is therefore called Bose-Einstein condensation in complex networks. Consequently addressing the dynamical properties of these nonequilibrium systems within the framework of equilibrium quantum gases predicts that the “first-mover-advantage,” “fit-get-rich (FGR),” and “winner-takes-all” phenomena observed in a competitive systems are thermodynamically distinct phases of the underlying evolving networks.^[2]

Schematic illustration of the mapping between the network model and the Bose gas.^[2]

The mathematical mapping of the network evolution to the Bose gas

Starting from the Bianconi-Barabási model, the mapping of a Bose gas to a network can be done by assigning an energy $ε i$ to each node, determined by its fitness through the relation^[2]^[16]

[math]\displaystyle{ \varepsilon_i=-\frac{1}{\beta}\ln{\eta_i} }[/math]

where $β = 1 / T$ . In particular when $β = 0$ all the nodes have equal fitness, when instead $β ≫ 1$ nodes with different "energy" have very different fitness. We assume that the network evolves through a modified preferential attachment mechanism. At each time a new node $i$ with energy $ε i$ drawn from a probability distribution $p (ε)$ enters in the network and attach a new link to a node $j$ chosen with probability:

[math]\displaystyle{ \Pi_j=\frac{e^{-\beta\varepsilon_j}k_j}{\sum_r e^{-\beta\varepsilon_r}k_r}. }[/math]

In the mapping to a Bose gas, we assign to every new link linked by preferential attachment to node $j$ a particle in the energy state $ε j$ .

The continuum theory predicts that the rate at which links accumulate on node $i$ with "energy" $ε i$ is given by

[math]\displaystyle{ \frac{\partial k_i(\varepsilon_i,t,t_i)}{\partial t}=m\frac{e^{-\beta\varepsilon_i}k_i(\varepsilon_i,t,t_i)}{Z_t} }[/math]

where [math]\displaystyle{ k_i(\varepsilon_i,t, t_i) }[/math] indicating the number of links attached to node $i$ that was added to the network at the time step [math]\displaystyle{ t_i }[/math]. [math]\displaystyle{ Z_t }[/math] is the partition function, defined as:

[math]\displaystyle{ Z_t=\sum_i e^{-\beta\varepsilon_i}k_i(\varepsilon_i,t,t_i). }[/math]

The solution of this differential equation is:

[math]\displaystyle{ k_i(\varepsilon_i,t,t_i)=m\left(\frac{t}{t_i}\right)^{f(\varepsilon_i)} }[/math]

where the dynamic exponent [math]\displaystyle{ f(\varepsilon) }[/math] satisfies [math]\displaystyle{ f(\varepsilon)=e^{-\beta(\varepsilon-\mu)} }[/math], $μ$ plays the role of the chemical potential, satisfying the equation

[math]\displaystyle{ \int d\varepsilon \, p(\varepsilon) \frac{1}{e^{\beta(\varepsilon-\mu)}-1}=1 }[/math]

where $p (ε)$ is the probability that a node has "energy" $ε$ and "fitness" $η = e -βε$ . In the limit, $t \to \infty$ , the occupation number, giving the number of links linked to nodes with "energy" $ε$ , follows the familiar Bose statistics

[math]\displaystyle{ n(\varepsilon)=\frac{1}{e^{\beta(\varepsilon -\mu)}-1}. }[/math]

The definition of the constant $μ$ in the network models is surprisingly similar to the definition of the chemical potential in a Bose gas. In particular for probabilities $p (ε)$ such that $p (ε) \to 0$ for $ε \to 0$ at high enough value of $β$ we have a condensation phase transition in the network model. When this occurs, one node, the one with higher fitness acquires a finite fraction of all the links. The Bose–Einstein condensation in complex networks is, therefore, a topological phase transition after which the network has a star-like dominant structure.

Bose–Einstein phase transition in complex networks

Numerical evidence for Bose–Einstein condensation in a network model.^[2]

The mapping of a Bose gas predicts the existence of two distinct phases as a function of the energy distribution. In the fit-get-rich phase, describing the case of uniform fitness, the fitter nodes acquire edges at a higher rate than older but less fit nodes. In the end the fittest node will have the most edges, but the richest node is not the absolute winner, since its share of the edges (i.e. the ratio of its edges to the total number of edges in the system) reduces to zero in the limit of large system sizes (Fig.2(b)). The unexpected outcome of this mapping is the possibility of Bose–Einstein condensation for $T < T BE$ , when the fittest node acquires a finite fraction of the edges and maintains this share of edges over time (Fig.2(c)).

A representative fitness distribution [math]\displaystyle{ \rho(\eta) }[/math] that leads to condensation is given by

[math]\displaystyle{ \rho(\eta)=(\lambda+1)(1-\eta)^\lambda, }[/math]

where [math]\displaystyle{ \lambda=1 }[/math].

However, the existence of the Bose–Einstein condensation or the fit-get-rich phase does not depend on the temperature or $β$ of the system but depends only on the functional form of the fitness distribution [math]\displaystyle{ \rho(\eta) }[/math] of the system. In the end, $β$ falls out of all topologically important quantities. In fact, it can be shown that Bose–Einstein condensation exists in the fitness model even without mapping to a Bose gas.^[17] A similar gelation can be seen in models with superlinear preferential attachment,^[18] however, it is not clear whether this is an accident or a deeper connection lies between this and the fitness model.

References

↑ ^1.0 ^1.1 ^1.2 Bianconi, Ginestra; Barabási, Albert-László (2001). "Competition and multiscaling in evolving networks.". Europhysics Letters 54 (4): 436–442. doi:10.1209/epl/i2001-00260-6. Bibcode: 2001EL.....54..436B.
↑ ^2.0 ^2.1 ^2.2 ^2.3 ^2.4 ^2.5 ^2.6 Bianconi, Ginestra; Barabási, Albert-László (2001). "Bose–Einstein condensation in complex networks". Physical Review Letters 86 (24): 5632–5635. doi:10.1103/physrevlett.86.5632. PMID 11415319. Bibcode: 2001PhRvL..86.5632B.
↑ Pastor-Satorras, Romualdo; Vespignani, Alessandro (2007). Evolution and structure of the Internet: A statistical physics approach. (1st ed.). Cambridge University Press.. p. 100.
↑ Barabási, Albert-László (2002). Linked: The New Science of Networks. Perseus Books Group. p. 95. https://archive.org/details/newsciencenetwor00albe_370.
↑ Vázquez, Alexei; Pastor-Satorras, Romualdo; Vespignani., Alessandro (2002). "Large-scale topological and dynamical properties of the Internet". Physical Review E 65 (6): 066130. doi:10.1103/physreve.65.066130. PMID 12188806. Bibcode: 2002PhRvE..65f6130V.
↑ Su, Guifeng; Xiaobing, Zhang; Zhang, Yi (2012). "Condensation phase transition in nonlinear fitness networks". EPL 100 (3): 38003. doi:10.1209/0295-5075/100/38003. Bibcode: 2012EL....10038003S.
↑ Caldarelli, Guido; Catanzaro, Michele (2012). Networks: A Very Short Introduction. Oxford University Press. p. 78.
↑ Guanrong, Chen; Xiaofan, Wang; Xiang, Li (2014). Fundamentals of Complex Networks: Models, Structures and Dynamics. p. 126.
↑ Kong, Joseph S.; Sarshar, Nima; Roychowdhury, Vwani P. (2008-09-16). "Experience versus talent shapes the structure of the Web" (in en). Proceedings of the National Academy of Sciences 105 (37): 13724–13729. doi:10.1073/pnas.0805921105. ISSN 0027-8424. PMID 18779560. Bibcode: 2008PNAS..10513724K.
↑ ^10.0 ^10.1 Pham, Thong; Sheridan, Paul; Shimodaira, Hidetoshi (2016-09-07). "Joint estimation of preferential attachment and node fitness in growing complex networks" (in en). Scientific Reports 6 (1): 32558. doi:10.1038/srep32558. ISSN 2045-2322. PMID 27601314. Bibcode: 2016NatSR...632558P.
↑ ^11.0 ^11.1 Bianconi, Ginestra (2005). "Emergence of weight-topology correlations in complex scale-free networks.". Europhysics Letters 71 (6): 1029–1035. doi:10.1209/epl/i2005-10167-2. Bibcode: 2005EL.....71.1029B.
↑ Barrat, Alan; Barthélemy, Marc; Vepsignani, Alessandro (2004). "The architecture of complex weighted networks.". Proceedings of the National Academy of Sciences 101 (11): 3747–3752. doi:10.1073/pnas.0400087101. PMID 15007165. Bibcode: 2004PNAS..101.3747B.
↑ Bianconi, Ginestra; Rahmede, Christoph (2017). "Emergent hyperbolic network geometry.". Scientific Reports 7: 41974. doi:10.1038/srep41974. PMID 28167818. Bibcode: 2017NatSR...741974B.
↑ Bianconi, Ginestra; Rahmede, Christoph (2016). "Network geometry with flavor: from complexity to quantum geometry.". Physical Review E 93 (3): 032315. doi:10.1103/PhysRevE.93.032315. PMID 27078374. Bibcode: 2016PhRvE..93c2315B.
↑ Caldarelli, Guido; Catanzaro, Michele (2012). Networks: A Very Short Introduction. Oxford University Press. p. 77.
↑ Albert, Réka; Barabási, Albert-László (2002-01-30). "Statistical mechanics of complex networks". Reviews of Modern Physics 74 (1): 47–97. doi:10.1103/revmodphys.74.47. ISSN 0034-6861. Bibcode: 2002RvMP...74...47A.
↑ Dorogovtsev, S. N.; Mendes, J. F. F. (2001-04-26). "Scaling properties of scale-free evolving networks: Continuous approach". Physical Review E 63 (5): 056125. doi:10.1103/physreve.63.056125. ISSN 1063-651X. PMID 11414979. Bibcode: 2001PhRvE..63e6125D.
↑ Krapivsky, P. L.; Redner, S.; Leyvraz, F. (2000-11-20). "Connectivity of Growing Random Networks". Physical Review Letters (American Physical Society (APS)) 85 (21): 4629–4632. doi:10.1103/physrevlett.85.4629. ISSN 0031-9007. PMID 11082613. Bibcode: 2000PhRvL..85.4629K.

External links

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Bianconi–Barabási model. Read more

[BB_model-1] 1.0 ^1.1 ^1.2 Bianconi, Ginestra; Barabási, Albert-László (2001). "Competition and multiscaling in evolving networks.". Europhysics Letters 54 (4): 436–442. doi:10.1209/epl/i2001-00260-6. Bibcode: 2001EL.....54..436B.

[BB_Bose-2] 2.0 ^2.1 ^2.2 ^2.3 ^2.4 ^2.5 ^2.6 Bianconi, Ginestra; Barabási, Albert-László (2001). "Bose–Einstein condensation in complex networks". Physical Review Letters 86 (24): 5632–5635. doi:10.1103/physrevlett.86.5632. PMID 11415319. Bibcode: 2001PhRvL..86.5632B.

[3] Pastor-Satorras, Romualdo; Vespignani, Alessandro (2007). Evolution and structure of the Internet: A statistical physics approach. (1st ed.). Cambridge University Press.. p. 100.

[4] Barabási, Albert-László (2002). Linked: The New Science of Networks. Perseus Books Group. p. 95. https://archive.org/details/newsciencenetwor00albe_370.

[5] Vázquez, Alexei; Pastor-Satorras, Romualdo; Vespignani., Alessandro (2002). "Large-scale topological and dynamical properties of the Internet". Physical Review E 65 (6): 066130. doi:10.1103/physreve.65.066130. PMID 12188806. Bibcode: 2002PhRvE..65f6130V.

[6] Su, Guifeng; Xiaobing, Zhang; Zhang, Yi (2012). "Condensation phase transition in nonlinear fitness networks". EPL 100 (3): 38003. doi:10.1209/0295-5075/100/38003. Bibcode: 2012EL....10038003S.

[Oxford_University_Press-7] Caldarelli, Guido; Catanzaro, Michele (2012). Networks: A Very Short Introduction. Oxford University Press. p. 78.

[8] Guanrong, Chen; Xiaofan, Wang; Xiang, Li (2014). Fundamentals of Complex Networks: Models, Structures and Dynamics. p. 126.

[9] Kong, Joseph S.; Sarshar, Nima; Roychowdhury, Vwani P. (2008-09-16). "Experience versus talent shapes the structure of the Web" (in en). Proceedings of the National Academy of Sciences 105 (37): 13724–13729. doi:10.1073/pnas.0805921105. ISSN 0027-8424. PMID 18779560. Bibcode: 2008PNAS..10513724K.

[:0-10] 10.0 ^10.1 Pham, Thong; Sheridan, Paul; Shimodaira, Hidetoshi (2016-09-07). "Joint estimation of preferential attachment and node fitness in growing complex networks" (in en). Scientific Reports 6 (1): 32558. doi:10.1038/srep32558. ISSN 2045-2322. PMID 27601314. Bibcode: 2016NatSR...632558P.

[Bia_weighted-11] 11.0 ^11.1 Bianconi, Ginestra (2005). "Emergence of weight-topology correlations in complex scale-free networks.". Europhysics Letters 71 (6): 1029–1035. doi:10.1209/epl/i2005-10167-2. Bibcode: 2005EL.....71.1029B.

[Vesp_weighted-12] Barrat, Alan; Barthélemy, Marc; Vepsignani, Alessandro (2004). "The architecture of complex weighted networks.". Proceedings of the National Academy of Sciences 101 (11): 3747–3752. doi:10.1073/pnas.0400087101. PMID 15007165. Bibcode: 2004PNAS..101.3747B.

[Bia_Hyperbolic-13] Bianconi, Ginestra; Rahmede, Christoph (2017). "Emergent hyperbolic network geometry.". Scientific Reports 7: 41974. doi:10.1038/srep41974. PMID 28167818. Bibcode: 2017NatSR...741974B.

[Bia_NGF-14] Bianconi, Ginestra; Rahmede, Christoph (2016). "Network geometry with flavor: from complexity to quantum geometry.". Physical Review E 93 (3): 032315. doi:10.1103/PhysRevE.93.032315. PMID 27078374. Bibcode: 2016PhRvE..93c2315B.

[15] Caldarelli, Guido; Catanzaro, Michele (2012). Networks: A Very Short Introduction. Oxford University Press. p. 77.

[bara-16] Albert, Réka; Barabási, Albert-László (2002-01-30). "Statistical mechanics of complex networks". Reviews of Modern Physics 74 (1): 47–97. doi:10.1103/revmodphys.74.47. ISSN 0034-6861. Bibcode: 2002RvMP...74...47A.

[dor-17] Dorogovtsev, S. N.; Mendes, J. F. F. (2001-04-26). "Scaling properties of scale-free evolving networks: Continuous approach". Physical Review E 63 (5): 056125. doi:10.1103/physreve.63.056125. ISSN 1063-651X. PMID 11414979. Bibcode: 2001PhRvE..63e6125D.

[kra-18] Krapivsky, P. L.; Redner, S.; Leyvraz, F. (2000-11-20). "Connectivity of Growing Random Networks". Physical Review Letters (American Physical Society (APS)) 85 (21): 4629–4632. doi:10.1103/physrevlett.85.4629. ISSN 0031-9007. PMID 11082613. Bibcode: 2000PhRvL..85.4629K.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

[15]

[16]

[17]

[18]

Anonymous

Search

Bianconi–Barabási model

Namespaces

More

Page actions

Contents

Concepts