Eigenvector synchronization, graph rigidity and the molecule problem

DOI10.1093/imaiai/ias002zbMath1278.05231arXiv1111.3304OpenAlexW3100598149WikidataQ37467373 ScholiaQ37467373MaRDI QIDQ2869799

David Cowburn, Mihai Cucuringu, Amit Singer

Publication date: 6 January 2014

Published in: Information and Inference (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.3304

zbMATH Keywords

eigenvectorsdistance geometrysynchronizationspectral graph theorySDPdivide and conquergraph realizationrigidity theorythe molecule problem

Mathematics Subject Classification ID

Applications of graph theory (05C90) Semidefinite programming (90C22) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

An extension of the angular synchronization problem to the heterogeneous setting, Rigidity Percolation in Disordered 3D Rod Systems, Embedding Riemannian manifolds by the heat kernel of the connection Laplacian, Spectral radius conditions for the rigidity of graphs, A survey of structure from motion., Local2global: a distributed approach for scaling representation learning on graphs, Lagrangian Duality in Complex Pose Graph Optimization, A unified approach to synchronization problems over subgroups of the orthogonal group, Unnamed Item, Graph connection Laplacian and random matrices with random blocks, Concentration of the Kirchhoff index for Erdős-Rényi graphs, Near-Optimal Bounds for Phase Synchronization, Rigid Graph Compression: Motif-Based Rigidity Analysis for Disordered Fiber Networks, Graph connection Laplacian methods can be made robust to noise, Spectral conditions for graph rigidity in the Euclidean plane, Barvinok's naive algorithm in distance geometry, Diagonally Dominant Programming in Distance Geometry, Group synchronization on grids, Global Registration of Multiple Point Clouds Using Semidefinite Programming, Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions

Uses Software

• DISCO