Coherence Scaling of Noisy Second-Order Scale-Free Consensus Networks

DOI10.1109/TCYB.2021.3052519MaRDI QIDQ6358699zbMATH OpenFDO

Authors W. Y. Xu, Bin Wu, Zuobai Zhang, Zhongzhi Zhang, Haibin Kan, Guanrong Chen

Publication date 20 January 2021

Full work available at URL https://doi.org/10.1109/TCYB.2021.3052519

Abstract: A striking discovery in the field of network science is that the majority of real networked systems have some universal structural properties. In generally, they are simultaneously sparse, scale-free, small-world, and loopy. In this paper, we investigate the second-order consensus of dynamic networks with such universal structures subject to white noise at vertices. We focus on the network coherence $H_{mSO}$ characterized in terms of the $mathcal{H}_2$-norm of the vertex systems, which measures the mean deviation of vertex states from their average value. We first study numerically the coherence of some representative real-world networks. We find that their coherence $H_{mSO}$ scales sublinearly with the vertex number $N$. We then study analytically $H_{mSO}$ for a class of iteratively growing networks -- pseudofractal scale-free webs (PSFWs), and obtain an exact solution to $H_{mSO}$, which also increases sublinearly in $N$, with an exponent much smaller than 1. To explain the reasons for this sublinear behavior, we finally study $H_{mSO}$ for Sierpin'ski gaskets, for which $H_{mSO}$ grows superlinearly in $N$, with a power exponent much larger than 1. Sierpin'ski gaskets have the same number of vertices and edges as the PSFWs, but do not display the scale-free and small-world properties. We thus conclude that the scale-free and small-world, and loopy topologies are jointly responsible for the observed sublinear scaling of $H_{mSO}$.

This page was built for publication: Coherence Scaling of Noisy Second-Order Scale-Free Consensus Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6358699)