Non-linear preferential attachment
In network science, preferential attachment means that nodes of a network tend to connect to those nodes which have more links.
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In network science, preferential attachment means that nodes of a network tend to connect to those nodes which have more links. If the network is growing and new nodes tend to connect to existing ones with linear probability in the degree of the existing nodes then preferential attachment leads to a scale-free network.
If this probability is sub-linear then the network's degree distribution is stretched exponential and hubs are much smaller than in a scale-free network. If this probability is super-linear then almost all nodes are connected to a few hubs. According to Kunegis, Blattner, and Moser several online networks follow a non-linear preferential attachment model.
Works
Communication networks and online contact networks are sub-linear while interaction networks are super-linear. The co-author network among scientists also shows the signs of sub-linear preferential attachment. where α > 0. This is a good approximation for a lot of real networks such as the Internet, the citation network or the actor network.
If α = 1 then the preferential attachment is linear. If α 1 then it is super-linear.
In measuring preferential attachment from real networks, the above log-linearity functional form k α can be relaxed to a free form function, i.e. (k) can be measured for each k without any assumptions on the functional form of (k). This is believed to be more flexible, and allows the discovery of non-log-linearity of preferential attachment in real networks.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1338876978 under CC BY-SA 4.0; modifications have been made.