Link prediction in multiplex networks via triadic closure
Alberto Aleta, Marta Tuninetti, Daniela Paolotti, Yamir Moreno, and, Michele Starnini

TL;DR
This paper introduces a novel link prediction algorithm for multiplex networks that leverages diverse relational data, outperforming existing methods and revealing insights into the importance of different network layers.
Contribution
It generalizes the Adamic-Adar method to multiplex networks, improving link prediction accuracy and analyzing layer redundancy and asymmetry.
Findings
The new metric outperforms classical methods across various systems.
Coefficients reveal layer redundancy and importance.
Asymmetry observed in layer-specific predictions.
Abstract
Link prediction algorithms can help to understand the structure and dynamics of complex systems, to reconstruct networks from incomplete data sets and to forecast future interactions in evolving networks. Available algorithms based on similarity between nodes are bounded by the limited amount of links present in these networks. In this work, we reduce this latter intrinsic limitation and show that different kind of relational data can be exploited to improve the prediction of new links. To this aim, we propose a novel link prediction algorithm by generalizing the Adamic-Adar method to multiplex networks composed by an arbitrary number of layers, that encode diverse forms of interactions. We show that the new metric outperforms the classical single-layered Adamic-Adar score and other state-of-the-art methods, across several social, biological and technological systems. As a byproduct,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
