More and more attention has focused on consensus problem in the study of complex networks. Many researchers investigated consensus dynamics in a linear dynamical system with additive stochastic disturbances. In this paper, we construct iterated line graphs of multi-subdivision graph by applying multi-subdivided-line graph operation. It has been proven that the network coherence can be characterized by the Laplacian spectrum of network. We study the recursion formula of Laplacian eigenvalues of the graphs. After that, we obtain the scalings of the first- and second-order network coherence.

中文翻译：

---

多细分图的迭代折线图的相干性分析

在复杂网络的研究中，越来越多的注意力集中在共识问题上。许多研究人员研究了具有加性随机扰动的线性动力学系统中的共识动力学。在本文中，我们通过应用多细分线图操作来构造多细分图的迭代线图。已经证明，网络相干性可以用网络的拉普拉斯谱来表征。我们研究了图的拉普拉斯特征值的递推公式。之后，我们获得了一阶和二阶网络相干性的尺度。