Cart (Loading....) | Create Account
Close category search window
 

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shafi, S.Y. ; Univ. of California, Berkeley, CA, USA ; Arcak, M. ; El Ghaoui, L.

We consider agents connected over a network, and propose a method to design an optimal interconnection such that the gap between the largest and smallest Laplacian eigenvalues of the graph representing the network is minimized. We study ways of imposing constraints that may arise in physical systems, such as enforcing lower bounds on connectivity and upper bounds on gain as well as network cost. In particular, we show that node and edge weights of a given graph can be simultaneously adjusted via convex optimization to achieve improvements in its Laplacian spectrum.

Published in:

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

Date of Conference:

Sept. 29 2010-Oct. 1 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.