Preferential attachment
Part of a series on  
Network science  

Network types  
Graphs  


Models  


 
A preferential attachment process is any of a class of processes in which some quantity, typically some form of wealth or credit, is distributed among a number of individuals or objects according to how much they already have, so that those who are already wealthy receive more than those who are not. "Preferential attachment" is only the most recent of many names that have been given to such processes. They are also referred to under the names Yule process, cumulative advantage, the rich get richer, and the Matthew effect. They are also related to Gibrat's law. The principal reason for scientific interest in preferential attachment is that it can, under suitable circumstances, generate power law distributions.^{[1]} If preferential attachment is nonlinear, measured distributions may deviate from a power law.^{[2]} These mechanisms may generate distributions which are approximately power law over transient periods.^{[3]}^{[4]}
Definition
A preferential attachment process is a stochastic urn process, meaning a process in which discrete units of wealth, usually called "balls", are added in a random or partly random fashion to a set of objects or containers, usually called "urns". A preferential attachment process is an urn process in which additional balls are added continuously to the system and are distributed among the urns as an increasing function of the number of balls the urns already have. In the most commonly studied examples, the number of urns also increases continuously, although this is not a necessary condition for preferential attachment and examples have been studied with constant or even decreasing numbers of urns.
A classic example of a preferential attachment process is the growth in the number of species per genus in some higher taxon of biotic organisms.^{[5]} New genera ("urns") are added to a taxon whenever a newly appearing species is considered sufficiently different from its predecessors that it does not belong in any of the current genera. New species ("balls") are added as old ones speciate (i.e., split in two) and, assuming that new species belong to the same genus as their parent (except for those that start new genera), the probability that a new species is added to a genus will be proportional to the number of species the genus already has. This process, first studied by Yule, is a linear preferential attachment process, since the rate at which genera accrue new species is linear in the number they already have.
Linear preferential attachment processes in which the number of urns increases are known to produce a distribution of balls over the urns following the socalled Yule distribution. In the most general form of the process, balls are added to the system at an overall rate of m new balls for each new urn. Each newly created urn starts out with k_{0} balls and further balls are added to urns at a rate proportional to the number k that they already have plus a constant a > −k_{0}. With these definitions, the fraction P(k) of urns having k balls in the limit of long time is given by^{[6]}
for k ≥ k_{0} (and zero otherwise), where B(x, y) is the Euler beta function:
with Γ(x) being the standard gamma function, and
The beta function behaves asymptotically as B(x, y) ~ x^{−y} for large x and fixed y, which implies that for large values of k we have
In other words, the preferential attachment process generates a "longtailed" distribution following a Pareto distribution or power law in its tail. This is the primary reason for the historical interest in preferential attachment: the species distribution and many other phenomena are observed empirically to follow power laws and the preferential attachment process is a leading candidate mechanism to explain this behavior. Preferential attachment is considered a possible candidate for, among other things, the distribution of the sizes of cities,^{[7]} the wealth of extremely wealthy individuals,^{[7]} the number of citations received by learned publications,^{[8]} and the number of links to pages on the World Wide Web.^{[1]}
The general model described here includes many other specific models as special cases. In the species/genus example above, for instance, each genus starts out with a single species (k_{0} = 1) and gains new species in direct proportion to the number it already has (a = 0), and hence P(k) = B(k, γ)/B(k_{0}, γ − 1) with γ=2 + 1/m. Similarly the Price model for scientific citations^{[8]} corresponds to the case k_{0} = 0, a = 1 and the widely studied BarabásiAlbert model^{[1]} corresponds to k_{0} = m, a = 0.
Preferential attachment is sometimes referred to as the Matthew effect, but the two are not precisely equivalent. The Matthew effect, first discussed by Robert K. Merton,^{[9]} is named for a passage in the biblical Gospel of Matthew: "For everyone who has will be given more, and he will have an abundance. Whoever does not have, even what he has will be taken from him." (Matthew 25:29, New International Version.) The preferential attachment process does not incorporate the taking away part. This point may be moot, however, since the scientific insight behind the Matthew effect is in any case entirely different. Qualitatively it is intended to describe not a mechanical multiplicative effect like preferential attachment but a specific human behavior in which people are more likely to give credit to the famous than to the little known. The classic example of the Matthew effect is a scientific discovery made simultaneously by two different people, one well known and the other little known. It is claimed that under these circumstances people tend more often to credit the discovery to the wellknown scientist. Thus the realworld phenomenon the Matthew effect is intended to describe is quite distinct from (though certainly related to) preferential attachment.
History
The first rigorous consideration of preferential attachment seems to be that of Udny Yule in 1925, who used it to explain the powerlaw distribution of the number of species per genus of flowering plants.^{[5]} The process is sometimes called a "Yule process" in his honor. Yule was able to show that the process gave rise to a distribution with a powerlaw tail, but the details of his proof are, by today's standards, contorted and difficult, since the modern tools of stochastic process theory did not yet exist and he was forced to use more cumbersome methods of proof.
Most modern treatments of preferential attachment make use of the master equation method, whose use in this context was pioneered by Simon in 1955, in work on the distribution of sizes of cities and other phenomena.^{[7]}
The first application of preferential attachment to learned citations was given by Price in 1976.^{[8]} (He referred to the process as a "cumulative advantage" process.) His was also the first application of the process to the growth of a network, producing what would now be called a scalefree network. It is in the context of network growth that the process is most frequently studied today. Price also promoted preferential attachment as a possible explanation for power laws in many other phenomena, including Lotka's law of scientific productivity and Bradford's law of journal use.
The application of preferential attachment to the growth of the World Wide Web was proposed by Barabási and Albert in 1999.^{[1]} Barabási and Albert also coined the name "preferential attachment" by which the process is best known today and suggested that the process might apply to the growth of other networks as well. For growing networks, the precise functional form of preferential attachment can be estimated by maximum likelihood estimation.^{[10]}
See also
 Assortative mixing
 Bose–Einstein condensation: a network theory approach
 Capital accumulation
 Chinese restaurant process
 Complex network
 Double jeopardy (marketing)
 Linkcentric preferential attachment
 Pitman–Yor process
 Price's model
 Proof of stake
 Simon model
 Wealth condensation
 Yule–Simon distribution
 Bibliogram
References
 ^ ^{a} ^{b} ^{c} ^{d} Barabási, A.L.; R. Albert (1999). "Emergence of scaling in random networks". Science. 286 (5439): 509–512. arXiv:condmat/9910332. Bibcode:1999Sci...286..509B. doi:10.1126/science.286.5439.509. PMID 10521342. S2CID 524106.
 ^ Krapivsky, P. L.; Redner, S.; Leyvraz, F. (20 November 2000). "Connectivity of Growing Random Networks". Physical Review Letters. 85 (21): 4629–4632. arXiv:condmat/0005139. doi:10.1103/PhysRevLett.85.4629. PMID 11082613. S2CID 16251662.
 ^ Krapivsky, Paul; Krioukov, Dmitri (21 August 2008). "Scalefree networks as preasymptotic regimes of superlinear preferential attachment". Physical Review E. 78 (2): 026114. arXiv:0804.1366. doi:10.1103/PhysRevE.78.026114. PMID 18850904. S2CID 14292535.
 ^ Falkenberg, Max; Lee, JongHyeok; Amano, Shunichi; Ogawa, Kenichiro; Yano, Kazuo; Miyake, Yoshihiro; Evans, Tim S.; Christensen, Kim (18 June 2020). "Identifying time dependence in network growth". Physical Review Research. 2 (2): 023352. arXiv:2001.09118. doi:10.1103/PhysRevResearch.2.023352.
 ^ ^{a} ^{b} Yule, G. U. (1925). "A Mathematical Theory of Evolution, based on the Conclusions of Dr. J. C. Willis, F.R.S". Philosophical Transactions of the Royal Society B. 213 (402–410): 21–87. doi:10.1098/rstb.1925.0002.
 ^ Newman, M. E. J. (2005). "Power laws, Pareto distributions and Zipf's law". Contemporary Physics. 46 (5): 323–351. arXiv:condmat/0412004. Bibcode:2005ConPh..46..323N. doi:10.1080/00107510500052444. S2CID 202719165.
 ^ ^{a} ^{b} ^{c} Simon, H. A. (1955). "On a class of skew distribution functions". Biometrika. 42 (3–4): 425–440. doi:10.1093/biomet/42.34.425.
 ^ ^{a} ^{b} ^{c} Price, D. J. de S. (1976). "A general theory of bibliometric and other cumulative advantage processes" (PDF). J. Amer. Soc. Inform. Sci. 27 (5): 292–306. doi:10.1002/asi.4630270505.
 ^ Merton, Robert K. (1968). "The Matthew effect in science". Science. 159 (3810): 56–63. Bibcode:1968Sci...159...56M. doi:10.1126/science.159.3810.56. PMID 17737466. S2CID 3526819.
 ^ Pham, Thong; Sheridan, Paul; Shimodaira, Hidetoshi (September 17, 2015). "PAFit: A Statistical Method for Measuring Preferential Attachment in Temporal Complex Networks". PLOS ONE. 10 (9): e0137796. Bibcode:2015PLoSO..1037796P. doi:10.1371/journal.pone.0137796. PMC 4574777. PMID 26378457.