Synchronous Networks Over Finite Fields

Jin Wang; Jun E. Feng; Yongyuan Yu; Hua Lin Huang

doi:10.1109/TAC.2023.3243051

Synchronous Networks Over Finite Fields

Jin Wang
, Jun E. Feng
, Yongyuan Yu^*
, Hua Lin Huang

^*Corresponding author for this work

Shandong University
Huaqiao University

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

Abstract

—This article investigates the synchronization problem of networks over finite fields. First, based on the finite-field synchronizable property of matrices, a necessary and sufficient condition is derived for finite-field synchronous networks. Then, the inverse recursion subspaces of networks over finite fields are studied. It is revealed that the synchronization of finite-field networks can be determined by a fraction of states. Finally, as an application, the obtained results are generalized to a class of Boolean networks.

Original language	English
Pages (from-to)	6907-6912
Number of pages	6
Journal	IEEE Transactions on Automatic Control
Volume	68
Issue number	11
DOIs	https://doi.org/10.1109/TAC.2023.3243051
State	Published - 1 Nov 2023
Externally published	Yes

Keywords

Boolean network
finite field
graph theory
synchronous network

Access to Document

10.1109/TAC.2023.3243051

Cite this

@article{d33c3adb14a64e388c5e80a27b12196c,

title = "Synchronous Networks Over Finite Fields",

abstract = "—This article investigates the synchronization problem of networks over finite fields. First, based on the finite-field synchronizable property of matrices, a necessary and sufficient condition is derived for finite-field synchronous networks. Then, the inverse recursion subspaces of networks over finite fields are studied. It is revealed that the synchronization of finite-field networks can be determined by a fraction of states. Finally, as an application, the obtained results are generalized to a class of Boolean networks.",

keywords = "Boolean network, finite field, graph theory, synchronous network",

author = "Jin Wang and Feng, \{Jun E.\} and Yongyuan Yu and Huang, \{Hua Lin\}",

note = "Publisher Copyright: {\textcopyright} 2023 IEEE.",

year = "2023",

month = nov,

day = "1",

doi = "10.1109/TAC.2023.3243051",

language = "英语",

volume = "68",

pages = "6907--6912",

journal = "IEEE Transactions on Automatic Control",

issn = "0018-9286",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "11",

}

TY - JOUR

T1 - Synchronous Networks Over Finite Fields

AU - Wang, Jin

AU - Feng, Jun E.

AU - Yu, Yongyuan

AU - Huang, Hua Lin

PY - 2023/11/1

Y1 - 2023/11/1

N2 - —This article investigates the synchronization problem of networks over finite fields. First, based on the finite-field synchronizable property of matrices, a necessary and sufficient condition is derived for finite-field synchronous networks. Then, the inverse recursion subspaces of networks over finite fields are studied. It is revealed that the synchronization of finite-field networks can be determined by a fraction of states. Finally, as an application, the obtained results are generalized to a class of Boolean networks.

AB - —This article investigates the synchronization problem of networks over finite fields. First, based on the finite-field synchronizable property of matrices, a necessary and sufficient condition is derived for finite-field synchronous networks. Then, the inverse recursion subspaces of networks over finite fields are studied. It is revealed that the synchronization of finite-field networks can be determined by a fraction of states. Finally, as an application, the obtained results are generalized to a class of Boolean networks.

KW - Boolean network

KW - finite field

KW - graph theory

KW - synchronous network

UR - https://www.scopus.com/pages/publications/85148428945

U2 - 10.1109/TAC.2023.3243051

DO - 10.1109/TAC.2023.3243051

M3 - 文章

AN - SCOPUS:85148428945

SN - 0018-9286

VL - 68

SP - 6907

EP - 6912

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

IS - 11

ER -

Synchronous Networks Over Finite Fields

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this