Given a measurement graph G=(V,E) and an unknown signal r∈Rn, we investigate algorithms for recovering r from pairwise measurements of the form ri−rj; {i,j}∈E. This problem arises in a variety of applications, such as ranking teams in sports data and time synchronization of distributed networks. Framed in the context of ranking, the task is to recover the ranking of n teams (induced by r) given a small subset of noisy pairwise rank offsets. We propose a simple SVD-based algorithmic pipeline for both the problem of time synchronization and ranking. We provide a detailed theoretical analysis in terms of robustness against both sampling sparsity and noise perturbations with outliers, using results from matrix perturbation and random matrix theory. Our theoretical findings are complemented by a detailed set of numerical experiments on both synthetic and real data, showcasing the competitiveness of our proposed algorithms with other state-of-the-art methods.

Citation information

A. d'Aspremont, M. Cucuringu, H. Tyagi, Ranking and synchronization from pairwise measurements via SVD, arXiv 1906.02746

Turing affiliated authors