scholarly journals Consensus Indices of Two-Layered Multi-Star Networks: An Application of Laplacian Spectrum

2021 ◽  
Vol 9 ◽  
Author(s):  
Da Huang ◽  
Jicheng Bian ◽  
Haijun Jiang ◽  
Zhiyong Yu

In this article, the convergence speed and robustness of the consensus for several dual-layered star-composed multi-agent networks are studied through the method of graph spectra. The consensus-related indices, which can measure the performance of the coordination systems, refer to the algebraic connectivity of the graph and the network coherence. In particular, graph operations are introduced to construct several novel two-layered networks, the methods of graph spectra are applied to derive the network coherence for the multi-agent networks, and we find that the adherence of star topologies will make the first-order coherence of the dual-layered systems increase some constants in the sense of limit computations. In the second-order case, asymptotic properties also exist when the index is divided by the number of leaf nodes. Finally, the consensus-related indices of the duplex networks with the same number of nodes but non-isomorphic structures have been compared and simulated, and it is found that both the first-order coherence and second-order coherence of the network D are between A and B, and C has the best first-order robustness, but it has the worst robustness in the second-order case.

Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1248
Author(s):  
Da Huang ◽  
Jian Zhu ◽  
Zhiyong Yu ◽  
Haijun Jiang

In this article, the consensus-related performances of the triplex multi-agent systems with star-related structures, which can be measured by the algebraic connectivity and network coherence, have been studied by the characterization of Laplacian spectra. Some notions of graph operations are introduced to construct several triplex networks with star substructures. The methods of graph spectra are applied to derive the network coherence, and some asymptotic behaviors of the indices have been derived. It is found that the operations of adhering star topologies will make the first-order coherence increase a constant value under the triplex structures as parameters tend to infinity, and the second-order coherence have some equality relations as the node related parameters tend to infinity. Finally, the consensus related indices of the triplex systems with the same number of nodes but non-isomorphic graph structures have been compared and simulated to verify the results.


2012 ◽  
Vol 59 (11) ◽  
pp. 2646-2654 ◽  
Author(s):  
Zhi-Hong Guan ◽  
Feng-Lan Sun ◽  
Yan-Wu Wang ◽  
Tao Li

IEEE Access ◽  
2016 ◽  
Vol 4 ◽  
pp. 8127-8137 ◽  
Author(s):  
Wenxia Cui ◽  
Yang Tang ◽  
Jian-An Fang ◽  
Jurgen Kurths

2014 ◽  
Vol 17 (4) ◽  
pp. 1320-1329 ◽  
Author(s):  
Guang-Song Han ◽  
Zhi-Hong Guan ◽  
Jie Chen ◽  
Ding-Xin He ◽  
Ming Chi

2013 ◽  
Vol 6 (4) ◽  
pp. 733-741 ◽  
Author(s):  
EDUARDO BARRIO ◽  
LAVINIA PICOLLO

It is widely accepted that a theory of truth for arithmetic should be consistent, butω-consistency is less frequently required. This paper argues thatω-consistency is a highly desirable feature for such theories. The point has already been made for first-order languages, though the evidence is not entirely conclusive. We show that in the second-order case the consequence of adoptingω-inconsistent truth theories for arithmetic is unsatisfiability. In order to bring out this point, well knownω-inconsistent theories of truth are considered: the revision theory of nearly stable truthT#and the classical theory of symmetric truthFS. Briefly, we present some conceptual problems withω-inconsistent theories, and demonstrate some technical results that support our criticisms of such theories.


Sign in / Sign up

Export Citation Format

Share Document