A remark on global positioning from local distances

DOI10.1073/pnas.0709842104zbMath1205.86043WikidataQ36775358 ScholiaQ36775358MaRDI QIDQ3075549

Amit Singer

Publication date: 15 February 2011

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://europepmc.org/articles/pmc2474529

zbMATH Keywords

eigenvectors; distance geometry; multidimensional scaling; sensor networks

Mathematics Subject Classification ID

62H05: Characterization and structure theory for multivariate probability distributions; copulas

62P99: Applications of statistics

86A30: Geodesy, mapping problems

Related Items

Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier, Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance, Localization from incomplete noisy distance measurements, Wasserstein distances in the analysis of time series and dynamical systems, Angular synchronization by eigenvectors and semidefinite programming, Reference free structure determination through eigenvectors of center of mass operators, Adaptive confidence sets for matrix completion, A new nonconvex approach to low-rank matrix completion with application to image inpainting, An adaptation for iterative structured matrix completion, An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming, Central limit theorems for classical multidimensional scaling, LRA: local rigid averaging of stretchable non-rigid shapes, The noise-sensitivity phase transition in spectral group synchronization over compact groups, Group synchronization on grids, Typical and generic ranks in matrix completion, A modified primal-dual method with applications to some sparse recovery problems, Matrix estimation by universal singular value thresholding, Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension, Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery, The Moreau envelope based efficient first-order methods for sparse recovery, Lagrangian Duality in Complex Pose Graph Optimization

Uses Software

• SeDuMi

Cites Work

• Unnamed Item
• An algorithm for two-dimensional rigidity percolation: The pebble game
• Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
• Rigid and Flexible Frameworks
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Distributed Graph Layout for Sensor Networks
• Framework for kernel regularization with application to protein clustering
• Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data