A Cheeger Inequality for the Graph Connection Laplacian
arXiv:1204.3873
Abstract
The O(d) Synchronization problem consists of estimating a set of unknown orthogonal transformations O_i from noisy measurements of a subset of the pairwise ratios O_iO_j^{-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.
To appear in the SIAM Journal on Matrix Analysis and Applications (SIMAX)
References in corpus (8)
- Flows and Decompositions of Games: Harmonic and Potential Games
- Cramér-Rao bounds for synchronization of rotations
- Simplicial complexes: spectrum, homology and random walks
- Estimation and Registration on Graphs
- Exact and Stable Recovery of Rotations for Robust Synchronization
- Multi-way spectral partitioning and higher-order Cheeger inequalities
- A Higher-Order Cheeger's Inequality
- Statistical ranking and combinatorial Hodge theory