Abstract
In this brief, the set stability problem for finite-field networks (FFNs) is investigated. This study covers stability and consensus as special cases. For the set stability of a given set, we provide several necessary and sufficient conditions on the network topology, weights, and the largest invariant subset (LIS) included in the set, respectively. Particularly, we apply abstract algebraic method to determine a special case, which can degenerate into stability and consensus. Additionally, transient period of FFNs are estimated by means of probability and invariant subsets.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Circuits and Systems II: Express Briefs
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
