## Hub (network science) |

In **hub** is a node with a number of links that greatly exceeds the average. Emergence of hubs is a consequence of a scale-free property of networks.^{[1]} While hubs cannot be observed in a random network, they are expected to emerge in

A hub is a component of a network with a high-degree *N* of the network and average degree *<k>* constant. The existence of hubs is the biggest difference between random networks and scale-free networks. In random networks, the degree *k* is comparable for every node; it is therefore not possible for hubs to emerge. In scale-free networks, a few nodes (hubs) have a high degree *k* while the other nodes have a small number of links.

- emergence
- attributes
- references

Emergence of hubs can be explained by the difference between scale-free networks and random networks. Scale-free networks (^{[2]}

- (a) Scale-free networks assume a continuous growth of the number of nodes
*N*, compared to random networks which assume a fixed number of nodes. In scale-free networks the degree of the largest hub rises polynomially with the size of the network. Therefore, the degree of a hub can be high in a scale-free network. In random networks the degree of the largest node rises logaritmically (or slower) with N, thus the hub number will be small even in a very large network. - (b) A new node in a scale-free network has a tendency to link to a node with a higher degree, compared to a new node in a random network which links itself to a random node. This process is called
preferential attachment . The tendency of a new node to link to a node with a high degree*k*is characterized bypower-law distribution (also known as rich-gets-richer process). This idea was introduced byVilfredo Pareto and it explained why a small percentage of the population earns most of the money. This process is present in networks as well, for example 80 percent of web links point to 15 percent of webpages. The emergence of scale-free networks is not typical only of networks created by human action, but also of such networks as metabolic networks or illness networks.^{[3]}This phenomenon may be explained by the example of hubs on the World Wide Web such as Facebook or Google. These webpages are very well known and therefore the tendency of other webpages pointing to them is much higher than linking to random small webpages.

The mathematical explanation for

The network begins with an initial connected network of nodes.

New nodes are added to the network one at a time. Each new node is connected to existing nodes with a probability that is proportional to the number of links that the existing nodes already have. Formally, the probability that the new node is connected to node is^{[2]}

where is the degree of the node and the sum is taken over all pre-existing nodes (i.e. the denominator results in twice the current number of edges in the network).

Emergence of hubs in networks is also related to time. In scale-free networks, nodes which emerged earlier have a higher chance of becoming a hub than latecomers. This phenomenon is called first-mover advantage and it explains why some nodes become hubs and some do not. However, in a real network, the time of emergence is not the only factor that influences the size of the hub. For example, Facebook emerged 8 years later after Google became the largest hub on the World Wide Web and yet in 2011 Facebook became the largest hub of WWW. Therefore, in real networks the growth and the size of a hub depends also on various attributes such as popularity, quality or the aging of a node.