Skip navigation
Please use this identifier to cite or link to this item:
Title: Graph Realization and Low-Rank Matrix Completion
Authors: Cucuringu, Mihai
Advisors: Singer, Amit
Contributors: Applied and Computational Mathematics Department
Keywords: distance geometry
eigenvector synchronization
graph realization
low rank matrix completion
molecule problem
sensor network localization
Subjects: Applied mathematics
Issue Date: 2012
Publisher: Princeton, NJ : Princeton University
Abstract: This thesis consists of five chapters, and focuses on two main problems: the graph realization problem with its applications to localization of sensor network and structural biology, and the low-rank matrix completion problem. Chapter 1 is a brief introduction to rigidity theory and supplies the background needed for the subsequent chapters. Chapter 2 introduces the graph realization problem in dimension two, and its application to sensor network localization. Chapter 3 considers the three dimensional graph realization problem and its application to the molecule problem from structural biology. Chapter 4 focuses on the group synchronization problem, and provides a more in-depth analysis of the synchronization methods used in our algorithms for the graph realization problem in R^2 and R^3. Finally, Chapter 5 investigates the problem of uniqueness of low-rank matrix completion, building on tools from rigidity theory.
Alternate format: The Mudd Manuscript Library retains one bound copy of each dissertation. Search for these copies in the library's main catalog
Type of Material: Academic dissertations (Ph.D.)
Language: en
Appears in Collections:Applied and Computational Mathematics

Files in This Item:
File Description SizeFormat 
Cucuringu_princeton_0181D_10225.pdf18.58 MBAdobe PDFView/Download

Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.