|
Frontiers of Information Technology & Electronic Engineering
ISSN 2095-9184 (print), ISSN 2095-9230 (online)
2020 Vol.21 No.6 P.931-938
Coherence analysis and Laplacian energy of recursive trees with controlled initial states
Abstract: We study the consensus of a family of recursive trees with novel features that include the initial states controlled by a parameter. The consensus problem in a linear system with additive noises is characterized as network coherence, which is defined by a Laplacian spectrum. Based on the structures of our recursive treelike model, we obtain the recursive relationships for Laplacian eigenvalues in two successive steps and further derive the exact solutions of first- and second-order coherences, which are calculated by the sum and square sum of the reciprocal of all nonzero Laplacian eigenvalues. For a large network size N, the scalings of the first- and second-order coherences are lnN and N$, respectively. The smaller the number of initial nodes, the better the consensus bears. Finally, we numerically investigate the relationship between network coherence and Laplacian energy, showing that the first- and second-order coherences increase with the increase of Laplacian energy at approximately exponential and linear rates, respectively.
Key words: Consensus, Network coherence, Laplacian energy
杭州电子科技大学理学院,中国杭州市,310018
摘要:本文研究一类具有受控初始状态递归树的一致性问题。由拉普拉斯谱定义的网络一致性用于刻画含有噪声线性系统的一致性动力学。基于这类递归树的规则结构,得到拉普拉斯特征值连续两次迭代的递归关系,并由此得到一阶和二阶一致性的精确解。它们由所有非零拉普拉斯特征值的倒数和与平方和来定义。一阶和二阶一致性的幂律关于网络规模N分别为lnN和NN。研究表明递归树初始节点数目越少,其一致性表现越好。最后,用数值例子研究一致性和拉普拉斯能量之间的关系,结果表明一阶和二阶一致性分别随拉普拉斯能量以指数和线性速率增长。
关键词组:
References:
Open peer comments: Debate/Discuss/Question/Opinion
<1>
DOI:
10.1631/FITEE.1900133
CLC number:
O155; TP11
Download Full Text:
Downloaded:
6947
Download summary:
<Click Here>Downloaded:
1480Clicked:
5372
Cited:
0
On-line Access:
2020-06-12
Received:
2019-03-08
Revision Accepted:
2019-06-23
Crosschecked:
2019-08-09