Coherence in a family of tree networks with an application of Laplacian spectrum
Coherence in a family of tree networks with an application of Laplacian spectrum
复制标题
应用拉普拉斯谱的树网络族的相干性
DOI:
10.1063/1.4897568
复制
发表时间:
2014-12-01
期刊:
影响因子:
2.9
通讯作者:
Chen, Fangyue
中科院分区:
文献类型:
--
作者:
Sun, Weigang;Ding, Qingyan;Chen, Fangyue
In this paper, we study consensus problems in a family of tree networks and investigate first and second order consensus denoted as network coherence characterized by Laplacian spectrum. According to the tree structures, we obtain the recursive relationships of Laplacian matrix and its Laplacian eigenvalues at two successive generations. We then obtain the analytical expressions for the sum of the reciprocals and the square reciprocals of all nonzero Laplacian eigenvalues. Finally, we calculate first and second order network coherence and see that the scalings of first and second order coherence with network size N are lnN and N, which are smaller than some studied tree graphs, such as Peano basin fractal, T-graph, and generalized Vicsek fractal. (C) 2014 AIP Publishing LLC.