Temporal similarity metrics for latent network reconstruction: The role of time-lag decay

Abstract

When investigating the spreading of a piece of information or the diffusion of an innovation, we often lack information on the underlying propagation network. Reconstructing the hidden propagation paths based on the observed diffusion process is a challenging problem which has recently attracted attention from diverse research fields. To address this reconstruction problem, based on static simi-A PREPRINT -APRIL 5, 2019 larity metrics commonly used in the link prediction literature, we introduce new node-node temporal similarity metrics. The new metrics take as input the time-series of multiple independent spreading processes, based on the hypothesis that two nodes are more likely to be connected if they were often infected at similar points in time. This hypothesis is implemented by introducing a time-lag function which penalizes distant infection times. We find that the choice of this time-lag strongly affects the metrics' reconstruction accuracy, depending on the network's clustering coefficient and we provide an extensive comparative analysis of static and temporal similarity metrics for network reconstruction. Our findings shed new light on the notion of similarity between pairs of nodes in complex networks.

Fast Representative Sampling in Large-Scale Online Social Networks

“…For different values of I , we still report the average situation over 3 realizations with varying sampling sizes ranging from 10 5 to 5×10 5 for Sina Weibo (see Fig. 4), and 10 6 to 5× 10 6 for Twitter (see Fig.…”

Visualizing Program Genres' Temporal-Based Similarity in Linear TV Recommendations

“…Temporal factors are explicitly or implicitly embedded into Pearson's correlation, Jaccard's similarity [14] or cosine similarity [2]. Furthermore, time weights and decays are used to prioritize recent data [4,7,9]. In contrast to past studies, we base genre similarity on the similarity of temporal patterns.…”