A Cheeger Inequality for the Graph Connection Laplacian
Abstract
The O(d) Synchronization problem consists of estimating a set of unknown orthogonal transformations Oi from noisy measurements of a subset of the pairwise ratios OiOj-1. We formulate and prove a Cheeger-type inequality that relates a measure of how well it is possible to solve the O(d) synchronization problem with the spectra of an operator, the graph Connection Laplacian. We also show how this inequality provides a worst case performance guarantee for a spectral method to solve this problem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.