Growth of common friends in a preferential attachment model

DOI10.1080/15326349.2021.1910521zbMATH Open1471.91392arXiv1908.04510OpenAlexW3155549641MaRDI QIDQ5157348FDOQ5157348

Authors: Bikramjit Das, Souvik Ghosh 

Publication date: 13 October 2021

Published in: Stochastic Models (Search for Journal in Brave)

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. 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.

Full work available at URL: https://arxiv.org/abs/1908.04510

Recommendations

• Preferred attachment in affiliation networks
• Growing network: models following nonlinear preferential attachment rule
• Preferential linking in the growth of online social networks
• Asymptotic normality of degree counts in a preferential attachment model
• Asymptotic normality of in- and out-degree counts in a preferential attachment model

zbMATH Keywords

social networklink predictionlimit theorempreferential attachmentheavy-tail

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Strong limit theorems (60F15)

Cites Work

• Directed scale-free graphs
• Fitting the linear preferential attachment model
• Random graphs and complex networks. Volume 1
• Emergence of Scaling in Random Networks
• Evolution of the social network of scientific collaborations
• The degree sequence of a scale-free random graph process
• A general model of web graphs
• On the subspaces of \(L^p\) \((p > 2)\) spanned by sequences of independent random variables
• Random networks with sublinear preferential attachment: degree evolutions
• Clustering function: another view on clustering coefficient
• Nonstandard regular variation of in-degree and out-degree in the preferential attachment model
• Tauberian theory for multivariate regularly varying distributions with application to preferential attachment networks
• Probability
• Consistency of Hill estimators in a linear preferential attachment model
• A preferential attachment process approaching the Rado graph

Cited In (1)

• Asymptotic behavior of common connections in sparse random networks

This page was built for publication: Growth of common friends in a preferential attachment model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5157348)