Link Prediction in Bipartite Nested Networks
AbstractReal networks typically studied in various research fields—ecology and economic complexity, for example—often exhibit a nested topology, which means that the neighborhoods of high-degree nodes tend to include the neighborhoods of low-degree nodes. Focusing on nested networks, we study the problem of link prediction in complex networks, which aims at identifying likely candidates for missing links. We find that a new method that takes network nestedness into account outperforms well-established link-prediction methods not only when the input networks are sufficiently nested, but also for networks where the nested structure is imperfect. Our study paves the way to search for optimal methods for link prediction in nested networks, which might be beneficial for World Trade and ecological network analysis. View Full-Text
Share & Cite This Article
Medo, M.; Mariani, M.S.; Lü, L. Link Prediction in Bipartite Nested Networks. Entropy 2018, 20, 777.
Medo M, Mariani MS, Lü L. Link Prediction in Bipartite Nested Networks. Entropy. 2018; 20(10):777.Chicago/Turabian Style
Medo, Matúš; Mariani, Manuel S.; Lü, Linyuan. 2018. "Link Prediction in Bipartite Nested Networks." Entropy 20, no. 10: 777.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.