Strong Recovery In Group Synchronization

by   Bradley Stich, et al.

The group synchronization problem is to estimate unknown group elements at the vertices of a graph when given a set of possibly noisy observations of group differences at the edges. We consider the group synchronization problem on finite graphs with size tending to infinity, and we focus on the question of whether the true edge differences can be exactly recovered from the observations (i.e., strong recovery). We prove two main results, one positive and one negative. In the positive direction, we prove that for a sequence of synchronization problems containing the complete digraph along with a relatively well behaved prior distribution and observation kernel, with high probability we can recover the correct edge labeling. Our negative result provides conditions on a sequence of sparse graphs under which it is impossible to recover the correct edge labeling with high probability.



There are no comments yet.


page 1

page 2

page 3

page 4


Inferring Graphs from Cascades: A Sparse Recovery Framework

In the Network Inference problem, one seeks to recover the edges of an u...

Independent Sets of Random Trees and of Sparse Random Graphs

An independent set of size k in a finite undirected graph G is a set of ...

Fairness constraints can help exact inference in structured prediction

Many inference problems in structured prediction can be modeled as maxim...

Partial Recovery in the Graph Alignment Problem

In this paper, we consider the graph alignment problem, which is the pro...

Graph Matching with Partially-Correct Seeds

The graph matching problem aims to find the latent vertex correspondence...

On recovery guarantees for angular synchronization

The angular synchronization problem of estimating a set of unknown angle...

ShapeFit: Exact location recovery from corrupted pairwise directions

Let t_1,...,t_n ∈R^d and consider the location recovery problem: given a...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.