On consensus of star-composed networks with an application of Laplacian spectrum
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.
- On Laplacian spectra of parametric families of closely connected networks with application to cooperative control
- Coherence in a family of tree networks with an application of Laplacian spectrum
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
- Distributed optimisation and control of graph Laplacian eigenvalues for robust consensus via an adaptive multilayer strategy
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- An introduction to the theory of graph spectra
- Coherence in a family of tree networks with an application of Laplacian spectrum
- Consensus and Coherence in Fractal Networks
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Distributed adaptive control for synchronization in directed complex networks
- Generalized multi-synchronization viewed as a multi-agent leader-following consensus problem
- Graph theory
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- Network synchronization in a population of star-coupled fractional nonlinear oscillators
- Node-to-node pinning control of complex networks
- On reaching group consensus for linearly coupled multi-agent networks
- Optimally balanced spanning tree of the star network
- Quantitative function and algorithm for community detection in bipartite networks
- Synchronization in uncertain complex networks
- The Kirchhoff indices and the matching numbers of unicyclic graphs
- The Laplacian spectrum of corona of two graphs
- The Spectrum of the Corona of Two Graphs
- Performance and design of cycles in consensus networks
- Analysis and applications of spectral properties of grounded Laplacian matrices for directed networks
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
- On Laplacian spectra of parametric families of closely connected networks with application to cooperative control
- Distributed optimisation and control of graph Laplacian eigenvalues for robust consensus via an adaptive multilayer strategy
This page was built for publication: On consensus of star-composed networks with an application of Laplacian spectrum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2398768)
