Answers are grounded in this paper and cite their sources.
This study focuses on the coherence in a class of unbalanced networks, emphasizing the investigation of the impact of leader selection and network parameters on coherence. We discuss three different categories of consensus algorithms: leaderless algorithms of first and second orders, and first-order leader-follower algorithm. Firstly, we derive exact solutions for leaderless network coherence in the first and second orders. Secondly, we design various leader allocation schemes for the first-order leader-follower networks, obtaining expressions correlated with the network scale <tex-math notation="LaTeX">N</tex-math>, the double-ring cardinalities <tex-math notation="LaTeX">P</tex-math> and q, and the number of leaders <tex-math notation="LaTeX">K</tex-math>. Thirdly, we conduct numerical simulations and robustness analyses to explore the impact of leader quantity and topology structure on network coherence. Specifically, the conclusions are as follows: (1) When N decreases, an increase in k demonstrates improved network coherence. (2) The smaller the difference between <tex-math notation="LaTeX">P</tex-math> and <tex-math notation="LaTeX">Q</tex-math>, the better the coherence. (3) The smaller the sum of <tex-math notation="LaTeX">P</tex-math> and <tex-math notation="LaTeX">P</tex-math>, the stronger the robustness. (4) Uniform distribution of <tex-math notation="LaTeX">K₁</tex-math> and <tex-math notation="LaTeX">K₂</tex-math> leads to optimal coherence. Finally, the Laplacian energy and Kirchhoff index of the network are analyzed.
No takes yet. Share an insight, caveat, or question.
Liu et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: