Containment problem of finite-field networks with fixed and switching topology

Yansheng Liu, Mengjin Song, Haitao Li, Yalu Li and Wenying Hou

Applied Mathematics and Computation, 2021, vol. 411, issue C

Abstract: The containment problem of finite-field networks (FFNs) with fixed topology (FT-FFNs) and switching topology (ST-FFNs) is studied. Firstly, the concept of containment for FFNs is proposed. Secondly, by semi-tensor product (STP) of matrices, the logical updating rule of FFNs with multiple leaders can be equivalently converted into an algebraic form. Thirdly, the containment problem is converted into the problem of set stability, and an easily verifiable necessary and sufficient condition is presented to achieve containment. In addition, the obtained results are applied to the containment problem of ST-FFNs. Finally, two examples support the effectiveness of the main results.

Keywords: Containment; Finite-field network; Set stability; Semi-tensor product of matrices; Switching topology (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321006081
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:411:y:2021:i:c:s0096300321006081

DOI: 10.1016/j.amc.2021.126519

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().