A Cheeger Inequality for the Graph Connection Laplacian

SIAM J. Matrix Analysis Applications, pp. 1611-1630, 2013.

Cited by: 83|Bibtex|Views10|DOI:https://doi.org/10.1137/120875338
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

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 a...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments