A Cheeger Inequality for the Graph Connection Laplacian

Details A Cheeger Inequality for the Graph Connection Laplacian A Cheeger Inequality for the Graph Connection Laplacian

2012-04-17

arxiv.org/abs/1204.3873v1

Mathematics

Spectral Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Cheeger Inequality for the Graph Connection Laplacian does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Cheeger Inequality for the Graph Connection Laplacian, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Cheeger Inequality for the Graph Connection Laplacian will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-290641