ASAP: an eigenvector synchronization algorithm for the graph realization problem

DOI10.1007/978-1-4614-5128-0_10MaRDI QIDQ2841706zbMATH OpenOpenAlexFDO

Authors Mihai Cucuringu

Publication date 29 July 2013

Published in Distance Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4614-5128-0_10

zbMATH Keywords

distance geometryeigenvectorsgraph realization problemmolecule problemrigidity theorysensor networksspectral graph theorysynchronization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90)

Recommendations

• Eigenvector synchronization, graph rigidity and the molecule problem
• Localization from incomplete noisy distance measurements
• Angular synchronization by eigenvectors and semidefinite programming
• A remark on global positioning from local distances
• A survey and evaluation of graph realization algorithms

Cited in

(3)

• On the estimation of latent distances using graph distances
• Eigenvector synchronization, graph rigidity and the molecule problem
• Vector diffusion maps and the connection Laplacian

Describes a project that uses

Uses Software

• SNLSDP

This page was built for publication: ASAP: an eigenvector synchronization algorithm for the graph realization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841706)