期刊
IEEE TRANSACTIONS ON CYBERNETICS
卷 49, 期 2, 页码 592-603出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2017.2781714
关键词
Convergence speed; delay robustness; distributed average consensus; graph Laplacians; hierarchical graph; multiagent systems; network coherence; self-similar networks; Sierpinski graph
类别
资金
- National Natural Science Foundation of China [61074119]
The hierarchical graphs and Sierpinski graphs are constructed iteratively, which have the same number of vertices and edges at any iteration, but exhibit quite different structural properties: the hierarchical graphs are nonfractal and small-world, while the Sierpinski graphs are fractal and largeworld. Both graphs have found broad applications. In this paper, we study consensus problems in hierarchical graphs and Sierpinski graphs, focusing on three important quantities of consensus problems, that is, convergence speed, delay robustness, and coherence for first-order (and second-order) dynamics, which are, respectively, determined by algebraic connectivity, maximum eigenvalue, and sum of reciprocal (and square of reciprocal) of each nonzero eigenvalue of Laplacian matrix. For both graphs, based on the explicit recursive relation of eigenvalues at two successive iterations, we evaluate the second smallest eigenvalue, as well as the largest eigenvalue, and obtain the closed-form solutions to the sum of reciprocals (and square of reciprocals) of all nonzero eigenvalues. We also compare our obtained results for consensus problems on both graphs and show that they differ in all quantities concerned, which is due to the marked difference of their topological structures.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据