当前位置：
X-MOL 学术
›
Stoch. Models
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Growth of common friends in a preferential attachment model
Stochastic Models ( IF 0.7 ) Pub Date : 2021-04-20 , DOI: 10.1080/15326349.2021.1910521 Bikramjit Das 1 , Souvik Ghosh 2
更新日期：2021-04-20
Stochastic Models ( IF 0.7 ) Pub Date : 2021-04-20 , DOI: 10.1080/15326349.2021.1910521 Bikramjit Das 1 , Souvik Ghosh 2
Affiliation
Abstract
The number of common friends (or connections) in a graph is a commonly used measure of proximity between two nodes. Such measures are used in link prediction algorithms and recommendation systems in large online social networks. We obtain the rate of growth of the number of common friends in a linear preferential attachment model. We apply our result to develop an estimate for the number of common friends that can significantly reduce the cost of computing these measures. We also observe a phase transition in the limiting behavior of the number of common friends; depending on the range of the parameters of the model, the growth is either power-law, or, logarithmic, or static with the size of the graph.
京公网安备 11010802027423号