Distributed network design for laplacian eigenvalue placement
We propose a distributed iterative algorithm in which a group of n autonomous agents self-organize the structure of their communication network in order to control the network's Laplacian eigenvalue spectrum. We assume that every agent has only access to a local ('myopic') view of the network around it and that there is no centralized coordinator. With every iteration of our algorithm, the agents share local information about their myopic views of the network in order to distributedly find the most beneficial global edge addition/deletion, defined as the one that minimizes a pseudometric defined in the space of Laplacian spectra. The proposed pseudometric is defined in terms of the Laplacian spectral moments and allows for an efficient distributed implementation. The proposed approach is greedy in nature and stable by construction, that is, it locally minimizes the distance of the network's eigenvalue spectrum to a desired spectrum. We illustrate the performance of our approach with several numerical simulations.
Duke Scholars
Published In
DOI
ISSN
Publication Date
Volume
Issue
Start / End Page
Related Subject Headings
- 4901 Applied mathematics
- 4606 Distributed computing and systems software
- 4006 Communications engineering
- 0906 Electrical and Electronic Engineering
- 0805 Distributed Computing
- 0102 Applied Mathematics
Citation
Published In
DOI
ISSN
Publication Date
Volume
Issue
Start / End Page
Related Subject Headings
- 4901 Applied mathematics
- 4606 Distributed computing and systems software
- 4006 Communications engineering
- 0906 Electrical and Electronic Engineering
- 0805 Distributed Computing
- 0102 Applied Mathematics