Consensus analysis of the weighted corona networks

Abstract

The consensus of complex networks has attracted the attention of many scholars. The graph operation is a common method to construct complex networks, which is helpful in studying the consensus of complex networks. Based on the corona networks G1◦G2, this study gives different weights to the edges of G1◦G2 to obtain the weighted corona networks G̃1◦G̃2 and studies the consensus of G̃1◦G̃2. The consensus of the networks can be measured by coherence. First, the Laplacian polynomial of G̃1◦G̃2 is derived by using the properties of an orthogonal matrix. Second, the relationship between the first-order coherence of G̃1◦G̃2 and G1 is deduced by using the relevant properties of the determinant and the conclusion of polynomial coefficients and the principal minors of the matrix. Third, the join operation is introduced to further simplify the analytical formula of network coherence. Finally, a specific network example is used to verify the validity of the conclusion.