On consensus of star-composed networks with an application of Laplacian spectrum (Q2398768)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On consensus of star-composed networks with an application of Laplacian spectrum |
scientific article |
Statements
On consensus of star-composed networks with an application of Laplacian spectrum (English)
0 references
21 August 2017
0 references
Summary: In this paper, we mainly study the performance of star-composed networks which can achieve consensus. Specifically, we investigate the convergence speed and robustness of the consensus of the networks, which can be measured by the smallest nonzero eigenvalue \(\lambda_2\) of the Laplacian matrix and the \(H_2\) norm of the graph, respectively. In particular, we introduce the notion of the corona of two graphs to construct star-composed networks and apply the Laplacian spectrum to discuss the convergence speed and robustness for the communication network. Finally, the performances of the star-composed networks have been compared, and we find that the network in which the centers construct a balanced complete bipartite graph has the most advantages of performance. Our research would provide a new insight into the combination between the field of consensus study and the theory of graph spectra.
0 references
consensus
0 references
star-composed networks
0 references
Laplacian spectrum
0 references
robustness for the communication network
0 references
balanced complete bipartite graph
0 references
0 references
0 references