Robustness of consensus in m-rose networks

The consensus of deterministic networks investigates the relationships between consensus and network topology, which can be measured by network coherence. The m -rose networks are composed of m circles, which share a common node. Recently, scholars have obtained the first-order coherence of 5-rose n...

Full description

Saved in:
Bibliographic Details
Published in:Frontiers in physics 2023-06, Vol.11
Main Authors: Du, Weiwei, Zhu, Jian, Gao, Haiping, Li, Xianyong
Format: Article
Language:English
Subjects:
coherence
consensus
Laplacian eigenvalues
m-rose
robustness
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The consensus of deterministic networks investigates the relationships between consensus and network topology, which can be measured by network coherence. The m -rose networks are composed of m circles, which share a common node. Recently, scholars have obtained the first-order coherence of 5-rose networks. This paper takes the more general m -rose networks as the research object, firstly, the m -rose networks are introduced. Secondly, the relationships between Laplacian eigenvalues and polynomial coefficients are used to obtain the first-order and second-order coherence of the m -rose networks. Finally, the effects of topology parameters such as the number of petals m and the length of a cycle n on the robustness of network consensus are discussed, and the validity of the conclusion is verified by numerical simulation.
ISSN:2296-424X
2296-424X
DOI:10.3389/fphy.2023.1199180