Localization from incomplete noisy distance measurements
DOI10.1007/s10208-012-9129-5zbMath1269.05098arXiv1103.1417OpenAlexW2142153450MaRDI QIDQ358631
Andrea Montanari, Adel Javanmard
Publication date: 9 August 2013
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.1417
semidefinite programmingmanifold learningnetwork localizationglobal rigiditygraph realizationrigidity theorystress matrix
Analysis of algorithms and problem complexity (68Q25) Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Graph algorithms (graph-theoretic aspects) (05C85) General theory of differentiable manifolds (58A99)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Wireless sensor network localization techniques
- Pattern avoiding ballot paths and finite operator calculus
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Comparison theorems for reversible Markov chains
- Some properties of invariant sets of a flow
- Generic global rigidity
- Conditions for Correct Sensor Network Localization Using SDP Relaxation
- A remark on global positioning from local distances
- 10.1162/153244304322972667
- Characterizing generic global rigidity
- The Rigidity of Graphs
- Random Geometric Graphs
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Framework for kernel regularization with application to protein clustering
- Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data