.png){kind=icon}
返回
Distributed Network Design for Laplacian Eigenvalue Placement
.png){kind=icon}
OA
AI
DOI：10.1109/TCNS.2016.2544249.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Algebraic graph theory
complex network design
distributed control
eigenvalue placement
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5
论文数:
1.7K
被引数:
5.8K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
Bilateral Cochlear Implants in Children: Localization Acuity Measured with Minimum Audible AngleOAAI
OAAI分享收藏
查看更多内容