Hidden Order of Boolean Networks
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.
Related Concept Videos
Network Function of a Circuit
Sequence Networks of Rotating Machines
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
Second-Order Circuits
Input signals typically originate from voltage or current sources, with the output often representing voltage across the capacitor and/or current through the inductor. For example, in...
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
First-Order Circuits
One common example of a first-order circuit is the RC (resistor-capacitor) circuit. These circuits are used in relaxation oscillators such as neon lamp oscillator circuits. When voltage is...
Relation between Mathematical Equations and Block Diagrams


