Eigenvector synchronization, graph rigidity and the molecule problem

Information and Inference

Volumn 1, Issue 1, 2012, Pages 21-67

  Cucuringu, Mihai ^a   Singer, Amit ^a   Cowburn, David ^b  

^a PRINCETON UNIVERSITY   (United States)

^b ALBERT EINSTEIN COLLEGE OF MEDICINE   (United States)

Author keywords

Conquer; Distance geometry; Divide; Eigenvectors; Graph realization; Rigidity theory; SDP; Spectral graph theory; Synchronization; The molecule problem

Indexed keywords

EID: 84892391966     PISSN: None     EISSN: 20498772     Source Type: Journal    
DOI: 10.1093/imaiai/ias002     Document Type: Article

References (62)

1. Ab, E., Atkinson, A. R., Banci, L., Bertini, I., Ciofi-Baffoni, S., Brunner, K., Diercks, T., Dotsch, V., Engelke, F. & Folkers, G. (2006) NMR in the SPINE structural proteomics project. Acta Crystallogr. D Biol. Crystallogr., 62, 1150-1161.
2. Anderson, B. D. O., Belhumeur, P. N., Eren, T., Goldenberg, D. K., Morse, A. S. & Whiteley, W. (2009) Graphical properties of easily localizable networks. Wirel. Netw., 15, 177-191.
3. Arun, K., Huang, T. & Bolstein, S. (1987) Least-squares fitting of Two 3-D point sets. IEEE Trans. Pattern Anal. Mach. Intell., 9, 698-700.
4. Aspnes, J., Eren, T., Goldenberg, D. K., Morse, A. S., Whiteley, W., Yang, Y. R., Anderson, B. D. O. & Belhumeur, P. N. (2006) A theory of network localization. IEEE Trans. Mob. Comput., 5, 1663-1678.
5. Aspnes, J., Goldenberg, D. K. & Yang, Y. R. (2004) On the computational complexity of sensor network localization. Proceedings of Algorithmic Aspects of Wireless Sensor Networks: First International Workshop (ALGOSENSORS). Lecture Notes in Computer Science. Berlin: Springer, pp. 32-44.
6. Bai, Z. & Golub, G. H. (1999) Some unusual matrix eigenvalue problems. Proceedings of VECPAR'98-Third International Conference for Vector and Parallel Processing. Proceedings of VECPAR'98, Porto, Portugal, June 21-23, 1998.
7. Bandeira, A. S., Singer, A. & Spielman, D. A. (2012) A Cheeger inequality for the graph connection Laplacian. arXiv:1204.3873v1 [math.SP].
8. Bax, A. & Grishaev, A. (2005) Weak alignment NMR: a hawk-eyed view of biomolecular structure. Curr. Opin. Struct. Biol., 15, 563-570.
9. Biswas, P., Aghajan, H. & Ye, Y. (2005) Semidefinite programming algorithms for sensor network localization using angle of arrival information. Proceeding of 39th Annual Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, November 2005, pp. 220-224.
10. Biswas, P., Lian, T. C., Wang, T. C. & Ye, Y. (2006) Semidefinite programming based algorithms for sensor network localization. ACM Trans. Sensor Netw., 2, 188-220.
11. Biswas, P., Liang, T., Toh, K., Ye, Y. & Wang, T. (2006) Semidefinite programming approaches for sensor network localization with noisy distance measurements. IEEE Trans. Autom. Sci. Eng., 3, 360-371.
12. Biswas, P., Toh, K. C. & Ye, Y. (2008) A distributed SDP approach for large scale noisy anchor-free graph realization with applications to molecular conformation. SIAM J. Sci. Comput., 30, 1251-1277.
13. Biswas, P. & Ye, Y. (2003) A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization. Technical Report. Department of Management Science and Engineering, Stanford University.
14. Biswas, P. & Ye, Y. (2004) Semidefinite programming for ad hoc wireless sensor network localization. Proceedings of the Third International Symposium on Information Processing in Sensor Networks. New York: ACM, pp. 46-54.
15. Borg, I. & Groenen, P. J. F. (2005) Modern Multidimensional Scaling: Theory and Applications. New York, NY: Springer.
16. Boyd, S., Ghaoui, L. E., Feron, E. & Balakrishnan, V. (1994) Linear Matrix Inequalities in System and Control Theory. SIAM: Society for Industrial and Applied Mathematics.
17. Connelly, R. (2005) Generic global rigidity. Discrete Comput. Geom., 33, 549-563.
18. Connelly, R. & Whiteley, W. J. (2009) Global rigidity: the effect of coning. Discrete Comput. Geom., ISSN 0179-5376 (Print) 1432-0444 (Online).
19. Cornilescu, G., Marquardt, J. L., Ottiger, M. & Bax, A. (1998) Validation of protein structure from anisotropic carbonyl chemical shifts in a dilute liquid crystalline phase. J. Amer. Chem. Soc., 120, 6836-6837.
20. Cox, T. F. & Cox, M. A. A. (2001) Multidimensional Scaling. Monographs on Statistics and Applied Probability, vol. 88. Boca Raton, FL: Chapman & Hall/CRC.
21. Cucuringu, M., Lipman, Y. & Singer, A. (2011) Sensor network localization by eigenvector synchronization over the Euclidean group. ACM Trans. Sensor Netw., New York, NY: ACM, vol. 8, pp. 1-42.
22. De Leeuw, J. (1977) Applications of Convex Analysis to Multidimensional Scaling. Recent Developments in Statistics (J. R. Barra, F. Brodeau, G. Romierand & B. V. Cutsem eds). Amsterdam: North Holland Publishing Company, pp. 133-146.
23. Ding, Y. (2007) On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming.
24. Fan, K. & Hoffman, A. J. (1955) Some metric inequalities in the space of matrices. Proc. Amer. Math. Soc., 6, 111-116.
25. Fedorov, D. G. & Kitaura, K. (2007) Extending the power of quantum chemistry to large systems with the fragment molecular orbital method. J. Phys. Chem. A, 111, 6904-6914. doi:10.1021/jp0716740. PMID 17511437.
26. Giridhar, A. & Kumar, P. R. (2006) Distributed clock synchronization over wireless networks: Algorithms and analysis. 45th IEEE Conference on Decision and Control, Proceedings of the 45th IEEE Conference on Decision and Control, San Diego, December 13-15, 2006. pp. 4915-4920.
27. Gortler, S. J., Healy, A. D. & Thurston, D. P. (2010) Characterizing generic global rigidity. Amer. J. Math., 132, 897-939.
28. Gotsman, C. & Koren, Y. (2004) Distributed graph layout for sensor networks. Proceeding of the International Symposium on Graph Drawing, Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, pp. 273-284. Revised Selected Papers. Lecture Notes in Computer Science 3383. Berlin: Springer.
29. Grant, M. & Boyd, S. (2008) Graph implementations for nonsmooth convex programs. Recent Advances in Learning and Control (V. Blondel, S. Boyd & H. Kimura eds). Lecture Notes in Control and Information Sciences. Berlin: Springer, pp. 95-110. http://stanford.edu/boyd/graph_dcp.html .
30. Grant, M. & Boyd, S. (2011) CVX: Matlab Software for Disciplined Convex Programming, version 1.21. http://cvxr.com/cvx.
31. Hendrickson, B. (1992) Conditions for unique graph realizations. SIAM J Comput, 21, 65-84.
32. Hendrickson, B. (1995) The molecule problem: exploiting structure in global optimization. SIAM J. Optim., 5, 835-857.
33. Hespanha, J. P. (2004) grPartition a MATLAB function for graph partitioning. Available at http://www.ece.ucsb.edu/ hespanha.
34. Horn, B., Hilden, H. & Negahdaripour, S. (1988) Closed-form solution of absolute orientation using orthonormal matrices. J. Opt. Soc. Amer. A, 5, 1127-1135.
35. Jackson, B. & Jordán, T. (2005) Connected rigidity matroids and unique realizations of graphs. J. Combin. Theory Ser. B, 94, 1-29.
36. Javanmard, A. & Montanari, A. (2011) Localization from Incomplete Noisy Distance Measurements. Submitted. http://arxiv.org/abs/1103.1417.
37. Ji, X. & Zha, H. (2004) Sensor positioning in wireless ad hoc sensor networks using multidimensional scaling. IEEE INFOCOM 2004, The 23rd Annual Joint Conference of the IEEE Computer and Communications Societies, Hong Kong, China, March 7-11, 2004. vol. 4, pp. 2652-2661. IEEE.
38. Karp, R., Elson, J., Estrin, D. & Shenker, S. (2003) Optimal and global time synchronization in sensornets. Discussion Paper, Center for Embedded Networked Sensing, University of California, Los Angeles.
39. Keller, J. B. (1975) Closest unitary, orthogonal and hermitian operators to a given operator. Math. Mag., 48, 192-197.
40. Khan, U. A., Kar, S. & Moura, J. M. F. (2010) DILAND: An algorithm for distributed sensor localization with noisy distance measurements. IEEE Trans. Signal Process., 58, 1940-1947.
41. Koren, Y., Gotsman, C. & Ben-Chen, M. (2005) PATCHWORK: Efficient Localization for Sensor Networks by Distributed Global Optimization. Discussion Paper.
42. Leung, N. H. Z. & Toh, K. C. (2009) An SDP-based divide-and-conquer algorithm for large-scale noisy anchor-free graph realization. SIAM Journal on Scientific Computing, vol. 31, pp. 4351-4372. c 2009 Society for Industrial and Applied Mathematics.
43. Moore, D., Leonard, J., Rus, D. & Teller, S. (2004) Robust distributed network localization with noisy range measurements. Proceedings of the Second ACM Conference on Embedded Networked Sensor Systems. Baltimore, MD, pp. 50-61.
44. Rieping, W., Habeck, M., Bardiaux, B., Bernard, A., Malliavin, T. & Nilges, M. (2007) ARIA2: automated NOE assignment and data integration in NMR structure calculation. Bioinformatics, 23, 381-382.
45. Saxe, J. B. (1979) Embeddability of weighted graphs in k-space is strongly NP-hard. Proceeding of the 17th Allerton Conference on Communication, Control and Computing, Monticello, Ill, USA, 1979, pp. 480-489.
46. Shang, Y. & Ruml, W. (2004) Improved MDS-based localization. Proceedings of IEEE Infocom, vol. 23. Hong Kong, China, pp. 2640-2651.
47. Shi, J. & Malik, J. (2000) Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell., 22, 888-905.
48. Singer, A. (2008) A remark on global positioning from local distances. Proc. Natl. Acad. Sci., 105, 9507-9511.
49. Singer, A. (2011) Angular synchronization by eigenvectors and semidefinite programming. Appl. Comput. Harmon. Anal., 30, 20-36.
50. Singer, A. & Shkolnisky, Y. (2011) Three-dimensional structure determination from common lines in Cryo-E by eigenvectors and semidefinite programming. SIAM J. Imaging Sci., 4, 543-572.
51. So, A. M. C. (2007) A semidefinite programming approach to the graph realization problem: theory, applications and extensions. Ph.D. Thesis, Stanford University.
52. So, A. M. C. & Ye, Y. (2005) Theory of semidefinite programming for sensor network localization. Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA), SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005. pp. 405-414. SIAM 2005, ISBN 0-89871-585-7.
53. Toh, K., Biswas, P. & Ye, Y. (2008) SNLSDP version 0 - A MATLAB software for sensor network localization. http://www.math.nus.edu.sg/ mattohkc/SNLSDP.html.
54. Tubaishat, M. & Madria, S. (2003) Sensor networks: an overview. IEEE Potentials, 22, 20-23.
55. von Luxburg, U. (2007) A tutorial on spectral clustering. Stat. Comput., 17, 395-416.
56. Vries, S. J. D., van Dijk, M. & Bonvin, A. (2010) The HADDOCK web server for data-driven biomolecular docking. Nature Protoc., 5, 883-897.
57. Wagner, D. & Wagner, F. (1993) Between min cut and graph bisection. Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, MFCS'93. London, UK: Springer, pp. 744-750.
58. Weinberger, K. Q., Sha, F., Zhu, Q. & Saul, L. K. (2007) Graph laplacian regularization for large-scale semidefinite programming. Advances in Neural Information Processing Systems (NIPS) (B. Schoolkopf, J. Platt, & T. Hofmann eds). Cambridge, MA: MIT Press.
59. Wuthrich, K. (2003) NMR studies of structure and function of biological macromolecules (Nobel Lecture). J. Biomol. NMR, 27, 13-39.
60. Yemini, Y. (1979) Some theoretical aspects of location-location problems. Proceedings of the IEEE Symposium on Foundation of Computer Science, 20th Annual Symposium on Foundations of Computer Science (FOCS 1979), San Juan, pp. 1-8.
61. Zhang, L., Liu, L., Gotsman, C. & Gortler, S. J. (2011) An as-rigid-as-possible approach to sensor network localization. ACM Trans. Sensor Netw., 6, pp.1-21.
62. Zhu, Z., So, A. M. C. & Ye, Y. (2010) Universal rigidity: towards accurate and efficient localization of wireless networks. Proceeding of IEEE INFOCOM. NFOCOM 2010: The 29th IEEE Conference on Computer Communications, San Diego, CA, USA.