Name
Abstract | ||
|---|---|---|
We study the problem of distributedly estimating the k largest/smallest eigenvalues and the associated eigenvectors of a (possibly weighted) graph. In this work, we propose a dynamical systems approach that is fully decentralized and has global convergence guarantees. We demonstrate the validity of our approach through rigorous theoretical analysis and experimental evaluation. |
Year | Venue | Field |
|---|---|---|
2017 | 2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC) | Convergence (routing),Applied mathematics,Graph,Mathematical optimization,Computer science,Matrix decomposition,Symmetric matrix,Dynamical systems theory,Eigenvalues and eigenvectors,Trajectory,Computation |
DocType | ISSN | Citations |
Conference | 0743-1546 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Spyridon Leonardos | 1 | 71 | 5.74 |
| Victor M. Preciado | 2 | 205 | 29.44 |
| Konstantinos Daniilidis | 3 | 3122 | 255.45 |