학술논문

Hidden Order of Boolean Networks
Document Type
Periodical
Source
IEEE Transactions on Neural Networks and Learning Systems IEEE Trans. Neural Netw. Learning Syst. Neural Networks and Learning Systems, IEEE Transactions on. 35(5):6667-6678 May, 2024
Subject
Computing and Processing
Communication, Networking and Broadcast Technologies
Components, Circuits, Devices and Systems
General Topics for Engineers
Boolean functions
Limit-cycles
Trajectory
Behavioral sciences
Topology
Network topology
Matrix decomposition
Boolean networks
dual networks
hidden order
semi-tensor product (STP) of matrices
Language
ISSN
2162-237X
2162-2388
Abstract
It is a common belief that the order of a Boolean network is mainly determined by its attractors, including fixed points and cycles. Using the semi-tensor product (STP) of matrices and the algebraic state-space representation (ASSR) of the Boolean networks, this article reveals that in addition to this explicit order, there is a certain implicit or hidden order, which is determined by the fixed points and limit cycles of their dual networks. The structure and certain properties of dual networks are investigated. Instead of a trajectory, which describes the evolution of a state, the hidden order provides a global horizon to describe the evolution of the overall network. We conjecture that the order of networks is mainly determined by the dual attractors via their corresponding hidden orders. Then these results about the Boolean networks are further extended to the $k$ -valued case.