A Cheeger Inequality for the Graph Connection Laplacian
From MaRDI portal
Publication:5413664
DOI10.1137/120875338zbMath1287.05081arXiv1204.3873OpenAlexW2008590575MaRDI QIDQ5413664
Amit Singer, Afonso S. Bandeira, Daniel A. Spielman
Publication date: 30 April 2014
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.3873
Programming involving graphs or networks (90C35) Quadratic programming (90C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical methods of relaxation type (49M20)
Related Items (42)
Expansion in matrix-weighted graphs ⋮ Kazdan-Warner equation on infinite graphs ⋮ From intrinsic optimization to iterated extended Kalman filtering on Lie groups ⋮ Alternating projection, ptychographic imaging and phase synchronization ⋮ Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods ⋮ Approximating the little Grothendieck problem over the orthogonal and unitary groups ⋮ The diffusion geometry of fibre bundles: horizontal diffusion maps ⋮ Magnetic-sparseness and Schrödinger operators on graphs ⋮ On recovery guarantees for angular synchronization ⋮ Distributed methods for synchronization of orthogonal matrices over graphs ⋮ Magnetic eigenmaps for the visualization of directed networks ⋮ Lagrangian Duality in Complex Pose Graph Optimization ⋮ A unified approach to synchronization problems over subgroups of the orthogonal group ⋮ Robust Phase Retrieval Algorithm for Time-Frequency Structured Measurements ⋮ The noise-sensitivity phase transition in spectral group synchronization over compact groups ⋮ Graph connection Laplacian and random matrices with random blocks ⋮ Spectral convergence of the connection Laplacian from random samples ⋮ Curvature and Higher Order Buser Inequalities for the Graph Connection Laplacian ⋮ The geometry of synchronization problems and learning group actions ⋮ Solving Jigsaw Puzzles by the Graph Connection Laplacian ⋮ Stable optimizationless recovery from phaseless linear measurements ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Random Laplacian matrices and convex relaxations ⋮ Frustration and isoperimetric inequalities for signed graphs ⋮ Tightness of the maximum likelihood semidefinite relaxation for angular synchronization ⋮ An isoperimetric constant for signed graphs ⋮ Ranking and Sparsifying a Connection Graph ⋮ A Local Clustering Algorithm for Connection Graphs ⋮ Unnamed Item ⋮ Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs ⋮ Phase retrieval from local measurements: improved robustness via eigenvector-based angular synchronization ⋮ Optimization via low-rank approximation for community detection in networks ⋮ Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians ⋮ Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem ⋮ Toward a spectral theory of cellular sheaves ⋮ Nonconvex Phase Synchronization ⋮ Group synchronization on grids ⋮ Deformed Laplacians and spectral ranking in directed networks ⋮ Non-unique games over compact groups and orientation estimation in cryo-EM ⋮ Global Registration of Multiple Point Clouds Using Semidefinite Programming ⋮ Partitions of networks that are robust to vertex permutation dynamics
This page was built for publication: A Cheeger Inequality for the Graph Connection Laplacian
