Coherence analysis of a class of weighted tree-like polymer networks

Abstract

Complex networks have elicited considerable attention from scientific communities. This paper investigates consensus dynamics in a linear dynamical system with additive stochastic disturbances, which is characterized as network coherence by the Laplacian spectrum. Firstly, we introduce a class of weighted tree-like polymer networks with the weight factor. Then, we deduce the recursive relationship of the eigenvalues of Laplacian matrix at two successive generations. Finally, we calculate the first- and second-order network coherence quantifying as the sum and square sum of reciprocals of all nonzero Laplacian eigenvalues. The obtained results show that the scalings of first-order coherence with network size obey four laws along with the range of the weight factor and the scalings of second-order coherence with network size obey five laws along with the range of the weight factor.