Adamic–Adar index explained

The Adamic–Adar index is a measure introduced in 2003 by Lada Adamic and Eytan Adar to predict links in a social network, according to the amount of shared links between two nodes. It is defined as the sum of the inverse logarithmic degree centrality of the neighbours shared by the two nodes^[1]

$$A(x,y)\; =\; \backslash sum\_\; \backslash frac$$

where

N(u) is the set of nodes adjacent to u . The definition is based on the concept that common elements with very large neighbourhoods are less significant when predicting a connection between two nodes compared with elements shared between a small number of nodes.

References

1. Web site: Adamic/Adar.

Further reading

• Friends and neighbors on the web. Adamic. Lada A. Adar. Eytan. 2262951. Social Networks. 25. 3. 211–230. 2003. Elsevier. 10.1016/S0378-8733(03)00009-1.
• Book: Provenance Data in Social Media. Geoffrey. Barbier. Zhuo Feng. Pritam Gundecha. Morgan & Claypool Publishers. 2013. 9781608457847.
• Book: Social Network-Based Recommender Systems. Daniel. Schall. Springer. 2015. 12. 9783319227351.
• Book: Link Prediction in Social Networks: Role of Power Law Distribution. Springer Briefs in Computer Science. Srinivas. Virinchi. Pabitra. Mitra. Springer. 2016. 9783319289229. 7.