Positive Edge Consensus of Complex Networks
研究了无向和有向节点网络中边的一致性控制问题，针对标称或不确定的正线性系统，提出了分布式正一致性算法，并给出了基于节点数和边数的一致性条件。
This paper focuses on addressing the consensus problem of edges for both undirected and directed nodal networks whose edges are described by nominal or uncertain positive linear systems. The definition of line graph is given, and the similar properties and connections between the two types of graphs are established. Based on the rigorous theoretical analysis, distributed positive consensus algorithms are proposed, and the main results are given without utilizing the global interaction information. Subsequently, sufficient conditions for consensus with positivity constraint are given via the vertex number and the edge number of the original nodal network. Furthermore, according to the properties of Metzler matrix, we also solve the consensus problem for multiple edges which are modeled by uncertain positive systems. Some simulation studies are finally presented to verify the feasibility and effectiveness of the proposed results.