This article has multiple issues. Please helpimprove it or discuss these issues on thetalk page.(Learn how and when to remove these messages) A major contributor to this article appears to have aclose connection with its subject. It may require cleanup to comply with Wikipedia's content policies, particularlyneutral point of view. Please discuss further on thetalk page.(June 2019) (Learn how and when to remove this message) This articlemay rely excessively on sourcestoo closely associated with the subject, potentially preventing the article from beingverifiable andneutral. Please helpimprove it by replacing them with more appropriatecitations toreliable, independent sources.(June 2019) (Learn how and when to remove this message) (Learn how and when to remove this message)

Part ofa series on
Network science
Theory
Graph Complex network Contagion Small-world Scale-free Community structure Percolation Evolution Controllability Graph drawing Social capital Link analysis Optimization Reciprocity Closure Homophily Transitivity Preferential attachment Balance theory Network effect Social influence
Network types
Informational (computing) Telecommunication Transport Social Scientific collaboration Biological Artificial neural Interdependent Semantic Spatial Dependency Flow on-Chip
Graphs
Features Clique Component Cut Cycle Data structure Edge Loop Neighborhood Path Vertex Adjacency list /matrix Incidence list /matrix Types Bipartite Complete Directed Hyper Labeled Multi Random Weighted
Metrics Algorithms
Centrality Degree Motif Clustering Degree distribution Assortativity Distance Modularity Efficiency
Models
Topology Random graph Erdős–Rényi Barabási–Albert Bianconi–Barabási Fitness model Watts–Strogatz Exponential random (ERGM) Random geometric (RGG) Hyperbolic (HGN) Hierarchical Stochastic block Blockmodeling Maximum entropy Soft configuration LFR Benchmark Dynamics Boolean network agent based Epidemic/SIR
Lists Categories
Topics Software Network scientists Category:Network theory Category:Graph theory
v t e

TheBianconi–Barabási model is a model innetwork 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 inventorsGinestra Bianconi andAlbert-László Barabási. This model is a variant of theBarabá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]

The Barabási–Albert (BA) model uses two concepts: growth andpreferential 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]

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

The assumption here is that a node’s fitness is independent of time, and is fixed. A new nodej withm links and a fitness${\displaystyle {\eta }_j}$ is added with each time-step.

The probability${\displaystyle {\mathrm{\Pi }}_i}$ that a new node connects to one of the existing links to a node${\displaystyle i}$ in the network depends on the number of edges,${\displaystyle k_i}$, and on the fitness${\displaystyle {\eta }_i}$ of node${\displaystyle i}$, such that,

${\displaystyle {\mathrm{\Pi }}_i=\frac{{\eta }_i{k}_i}{\sum _j{\eta }_j{k}_j}.}$

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

${\displaystyle \frac{\mathrm{\partial }{k}_i}{\mathrm{\partial }t}=m\frac{{\eta }_i{k}_i}{\sum _j{\eta }_j{k}_j}}$

Assuming the evolution of${\displaystyle k_i}$ follows a power law with a fitness exponent${\displaystyle \beta ({\eta }_i)}$

${\displaystyle k(t,t_i,{\eta }_i)=m{\left(\frac{t}{t_i}\right)}^{\beta ({\eta }_i)}}$,

where${\displaystyle t_i}$ is the time since the creation of node${\displaystyle i}$.

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

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

When fitnesses are equal, the probability${\displaystyle {\mathrm{\Pi }}_i}$ that the new node is connected to node${\displaystyle i}$ when${\displaystyle k_i}$ is the degree of node${\displaystyle i}$ is,

${\displaystyle {\mathrm{\Pi }}_i=\frac{k_i}{\sum _j{k}_j}.}$

Degree distribution of the Bianconi–Barabási model depends on the fitness distribution${\displaystyle \rho (\eta )}$. 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]

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

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 in networks is aphase transition observed incomplex 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 themathematical model explainingBose–Einstein condensation in physics.

Inphysics, aBose–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: aboson or afermion. For example, an electron is a fermion, while a photon or ahelium atom is a boson. Inquantum 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 thePauli 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 aBose gas can be crowded into the lowest energy state, creating a Bose–Einstein condensate.

Bose and Einstein have established that the statistical properties of aBose gas are governed by theBose–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 temperatureT =⁠1/β⁠ is given by the Bose occupation number

${\displaystyle n(\epsilon )=\frac{1}{e^{\beta (\epsilon -\mu )}-1}}$

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

${\displaystyle N=\int d\epsilon g(\epsilon )n(\epsilon )}$

withg(ε) being the density of states of the system.

This last equation may lack a solution at low enough temperatures wheng(ε) → 0 forε → 0. In this case a critical temperatureT_c is found such that forT <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 statesg(ε) depends on the dimensionality of the space. In particular${\displaystyle g(\epsilon )\sim {\epsilon }^{\frac{d-2}{2}}}$ thereforeg(ε) → 0 forε → 0 only in dimensionsd > 2. Therefore, a Bose-Einstein condensation of an ideal Bose gas can only occur for dimensionsd > 2.

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 asfitness 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]

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]

${\displaystyle {\epsilon }_i=-\frac{1}{\beta }\ln {\eta }_i}$

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 modifiedpreferential attachment mechanism. At each time a new nodei with energyε_i drawn from a probability distributionp(ε) enters in the network and attach a new link to a nodej chosen with probability:

${\displaystyle {\mathrm{\Pi }}_j=\frac{e^{-\beta {\epsilon }_j}{k}_j}{\sum _r{e}^{-\beta {\epsilon }_r}{k}_r}.}$

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

The continuum theory predicts that the rate at which links accumulate on nodei with "energy"ε_i is given by

${\displaystyle \frac{\mathrm{\partial }{k}_i({\epsilon }_i,t,t_i)}{\mathrm{\partial }t}=m\frac{e^{-\beta {\epsilon }_i}{k}_i({\epsilon }_i,t,t_i)}{Z_t}}$

where${\displaystyle k_i({\epsilon }_i,t,t_i)}$ indicating the number of links attached to nodei that was added to the network at the time step${\displaystyle t_i}$.${\displaystyle Z_t}$ is thepartition function, defined as:

${\displaystyle Z_t=\sum _i{e}^{-\beta {\epsilon }_i}{k}_i({\epsilon }_i,t,t_i).}$

The solution of this differential equation is:

${\displaystyle k_i({\epsilon }_i,t,t_i)=m{\left(\frac{t}{t_i}\right)}^{f({\epsilon }_i)}}$

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

${\displaystyle \int d\epsilon p(\epsilon )\frac{1}{e^{\beta (\epsilon -\mu )}-1}=1}$

wherep(ε) is the probability that a node has "energy"ε and "fitness"η =e^−βε. In the limit,t → ∞, the occupation number, giving the number of links linked to nodes with "energy"ε, follows the familiar Bose statistics

${\displaystyle n(\epsilon )=\frac{1}{e^{\beta (\epsilon -\mu )}-1}.}$

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 probabilitiesp(ε) such thatp(ε) → 0 forε → 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, atopological phase transition after which the network has a star-like dominant structure.

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 forT <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 representativefitness distribution${\displaystyle \rho (\eta )}$ that leads to condensation is given by

${\displaystyle \rho (\eta )=(\lambda +1)(1-\eta {)}^{\lambda },}$

where${\displaystyle \lambda =1}$.

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${\displaystyle \rho (\eta )}$ 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 withsuperlinear preferential attachment,^[18] however, it is not clear whether this is an accident or a deeper connection lies between this and the fitness model.

• Barabási–Albert model

• Networks: A Very Short Introduction
• Advance Network Dynamics

• Social network analysis
• Graph algorithms
• Random graphs

• Wikipedia articles with possible conflicts of interest from June 2019
• Articles lacking reliable references from June 2019
• All articles lacking reliable references
• Articles with multiple maintenance issues