Designing node and edge weights of a graph to meet Laplacian eigenvalue constraints

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Volumn , Issue , 2010, Pages 1016-1023

  Shafi, S Yusef ^a   Arcak, Murat ^a   El Ghaoui, Laurent ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE WEIGHTS; LAPLACIAN EIGENVALUES; LAPLACIAN SPECTRA; LAPLACIANS; LOWER BOUNDS; NETWORK COSTS; PHYSICAL SYSTEMS; UPPER BOUND;

CONVEX OPTIMIZATION; EIGENVALUES AND EIGENFUNCTIONS; LAPLACE TRANSFORMS; OPTIMIZATION;

GRAPH THEORY;

EID: 79952428990     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2010.5707021     Document Type: Conference Paper

References (17)

1. F. Chung, "Spectral graph theory," American Mathematical Society, 1997.
2. M. Fiedler, "Algebraic connectivity of graphs," Czechoslovak Mathematical Journal, vol. 23, no. 2, pp. 298-305, 1973.
3. J. Fax and R. Murray, "Information flow and cooperative control of vehicle formations," IEEE Transactions on Automatic Control, vol. 49, no. 9, pp. 1465-1476, 2004.
4. A. Jadbabaie, J. Lin, and A. Morse, "Coordination of groups of mobile autonomous agents using nearest neighbor rules," IEEE Transactions on Automatic Control, vol. 48, no. 6, pp. 988-1001, 2003.
5. R. Olfati-Saber and R. Murray, "Consensus problems in networks of agents with switching topology and time-delays," IEEE Transactions on Automatic Control, vol. 49, no. 9, pp. 1520-1533, 2004.
6. J. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE Transactions on pattern analysis and machine intelligence, vol. 22, no. 8, pp. 888-905, 2000.
7. M. Arcak, "Passivity as a design tool for group coordination," IEEE Transactions on Automatic Control, vol. 52, no. 8, pp. 1380-1390, 2007.
8. H. Bai and M. Arcak, "Instability mechanisms in cooperative control," IEEE transactions on automatic control, vol. 55, no. 1, pp. 258-263, 2010.
9. L. Xiao and S. Boyd, "Fast linear iterations for distributed averaging," Systems & Control Letters, vol. 53, no. 1, pp. 65-78, 2004.
10. A. Ghosh, S. Boyd, and A. Saberi, "Minimizing effective resistance of a graph," SIAM review, vol. 50, no. 1, p. 37, 2008.
11. S. Boyd, P. Diaconis, and L. Xiao, "Fastest mixing Markov chain on a graph," SIAM review, vol. 46, no. 4, pp. 667-689, 2004.
12. J. Sun, S. Boyd, L. Xiao, and P. Diaconis, "The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem," SIAM review, vol. 48, no. 4, pp. 681-699, 2006.
13. Y. Kim and M. Mesbahi, "On maximizing the second smallest eigenvalue of a state-dependent graph Laplacian," IEEE Transactions on Automatic Control, vol. 51, no. 1, p. 117, 2006.
14. R. Horn and C. Johnson, Matrix analysis. Cambridge Univ Pr, 1990.
15. F. Gantmacher, The theory of matrices. Chelsea Pub Co, 2000.
16. M. Grant and S. Boyd, "CVX: Matlab software for disciplined convex programming, version 1.21," http://cvxr.com/cvx, Sep. 2010.
17. P. Seiler, A. Pant, and K. Hedrick, "Disturbance propagation in vehicle strings," IEEE Transactions on Automatic Control, vol. 49, no. 10, pp. 1835-1842, 2004.