The application of preferential attachment to the growth of the World Wide Web was proposed by [[BA model|Barabási and Albert]] in 1999. 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]].<ref>{{cite journal |last1=Pham |first1=Thong |last2=Sheridan |first2=Paul |last3=Shimodaira |first3=Hidetoshi |title=PAFit: A Statistical Method for Measuring Preferential Attachment in Temporal Complex Networks |journal=PLoS ONE |date=September 17, 2015 |volume=10 |issue=9 |doi=10.1371/journal.pone.0137796 |url=http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0137796 |pages=e0137796 |pmid=26378457 |pmc=4574777|bibcode=2015PLoSO..1037796P }}</ref>
+
The application of preferential attachment to the growth of the World Wide Web was proposed by [[BA model|Barabási and Albert]] in 1999. 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]].
The application of preferential attachment to the growth of the World Wide Web was proposed by Barabási and Albert in 1999.
The application of preferential attachment to the growth of the World Wide Web was proposed by Barabási and Albert in 1999.
−
1999年,Barabási 和 Albert 提出了优先链接在万维网发展中的应用。<ref name=BAScience />
+
1999年,Barabási 和 Albert 提出了优先链接在万维网发展中的应用。<ref name=BAScience />他们也杜撰了该过程被广为知晓的名字——“优先链接”,并且表明这个过程也可以应用于其他网络的增长。对增长的网络来说,优先链接的精确作用形式可以用极大似然估计来估计。<ref>{{cite journal |last1=Pham |first1=Thong |last2=Sheridan |first2=Paul |last3=Shimodaira |first3=Hidetoshi |title=PAFit: A Statistical Method for Measuring Preferential Attachment in Temporal Complex Networks |journal=PLoS ONE |date=September 17, 2015 |volume=10 |issue=9 |doi=10.1371/journal.pone.0137796 |url=http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0137796 |pages=e0137796 |pmid=26378457 |pmc=4574777|bibcode=2015PLoSO..1037796P }}</ref>