期刊
COMPUTER JOURNAL
卷 58, 期 12, 页码 3242-3254出版社
OXFORD UNIV PRESS
DOI: 10.1093/comjnl/bxv014
关键词
distributed average consensus; small-world network; graph Laplacian; networked control system
类别
资金
- National Natural Science Foundation of China [11275049]
- Hong Kong Research Grants Council under GRF Grant [CityU 1109/12]
In this paper, we study the first-order consensus algorithm in the small-world Farey graph where agents are driven by white noise, aiming to unveil the effect of small-world topology on the robustness of the consensus algorithm. We characterize the coherence of the Farey graph in terms of the H-2-norm of the system, the square of which equals the steady-state variance and thus captures how closely agents track the consensus value. Based on the particular network structure, we derive an exact expression for the coherence in the Farey graph, whose dominant behavior scales logarithmically with the system size. To uncover the role of small-world topology, we also derive an analytical solution for the coherence of first-order consensus in the regular ring lattice sharing the same average degree as the Farey graph, whose dominant term grows linearly with the system size, implying that the small-world structure strongly affects the performance of the consensus algorithm.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据