Link prediction in dynamic networks using random dot product graphs

Abstract

The problem of predicting links in large networks is an important task in a variety of practical applications, including social sciences, biology and computer security. In this paper, statistical techniques for link prediction based on the popular random dot product graph model are carefully presented, analysed and extended to dynamic settings. Motivated by a practical application in cyber-security, this paper demonstrates that random dot product graphs not only represent a powerful tool for inferring differences between multiple networks, but are also efficient for prediction purposes and for understanding the temporal evolution of the network. The probabilities of links are obtained by fusing information at two stages: spectral methods provide estimates of latent positions for each node, and time series models are used to capture temporal dynamics. In this way, traditional link prediction methods, usually based on decompositions of the entire network adjacency matrix, are extended using temporal information. The methods presented in this article are applied to a number of simulated and real-world graphs, showing promising results.

References in corpus (11)

• Semi-Supervised Classification with Graph Convolutional Networks
• Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks
• Dynamic stochastic blockmodels for time-evolving social networks
• Latent Space Models for Dynamic Networks
• A Comparative Study for Unsupervised Network Representation Learning
• Inference for multiple heterogeneous networks with a common invariant subspace
• Semiparametric spectral modeling of the Drosophila connectome
• DynamicGEM: A Library for Dynamic Graph Embedding Methods
• The Multiple Random Dot Product Graph Model
• The multilayer random dot product graph
• Graph-aware Modeling of Brain Connectivity Networks

Cited by in corpus (1)

• The multilayer random dot product graph