A new link prediction in multiplex networks using topologically biased random walks

Link prediction is a technique to forecast future new or missing relationships between nodes based on the current network information. However, the link prediction in monoplex networks seems to have a long background, the attempts to accomplish the same task on multiplex networks are not abundant, and it was often a challenge to apply conventional similarity methods to multiplex networks. The issue of link prediction in multiplex networks is the way of predicting the links in one layer, taking structural information of other layers into account. One of the most important methods of link prediction in a monoplex network is a local random walk (LRW) that captures the network structure using pure random walking to measure nodes similarity of the graph and find unknown connections. The goal of this paper is to propose an extended version of local random walk based on pure random walking for solving link prediction in the multiplex network, referred to as the Multiplex Local Random Walk (MLRW). We explore approaches for leveraging information mined from inter-layer and intra-layer in a multiplex network to define a biased random walk for finding the probability of the appearance of a new link in one target layer. Experimental studies on seven multiplex networks in the real world demonstrate that a multiplex biased local random walk performs better than the state-of-the-art methods of link prediction and corresponding unbiased case and improves prediction accuracy. (c) 2021 Elsevier Ltd. All rights reserved.

Automated summary

This paper aims to propose a method for link prediction in multiplex networks, called Multiplex Local Random Walk (MLRW). Experimental studies show that the multiplex biased local random walk method outperforms current link prediction methods in terms of accuracy.