Synchronization in output-coupled temporal Boolean networks

This paper presents an analytical study of synchronization in an array of output-coupled temporal Boolean networks. A temporal Boolean network (TBN) is a logical dynamic system developed to model Boolean networks with regulatory delays. Both state delay and output delay are considered, and these two delays are assumed to be different. By referring to the algebraic representations of logical dynamics and using the semi-tensor product of matrices, the output-coupled TBNs are firstly converted into a discrete-time algebraic evolution system, and then the relationship between the states of coupled TBNs and the initial state sequence is obtained. Then, some necessary and sufficient conditions are derived for the synchronization of an array of TBNs with an arbitrary given initial state sequence. Two numerical examples including one epigenetic model are finally given to illustrate the obtained results

Topological and Graph-coloring Conditions on the Parameter-independent Stability of Second-order Networked Systems

In this paper, we study parameter-independent stability in qualitatively heterogeneous passive networked systems containing damped and undamped nodes. Given the graph topology and a set of damped nodes, we ask if output consensus is achieved for all system parameter values. For given parameter values, an eigenspace analysis is used to determine output consensus. The extension to parameter-independent stability is characterized by a coloring problem, named the richly balanced coloring (RBC) problem. The RBC problem asks if all nodes of the graph can be colored red, blue and black in such a way that (i) every damped node is black, (ii) every black node has blue neighbors if and only if it has red neighbors, and (iii) not all nodes in the graph are black. Such a colored graph is referred to as a richly balanced colored graph. Parameter-independent stability is guaranteed if there does not exist a richly balanced coloring. The RBC problem is shown to cover another well-known graph coloring scheme known as zero forcing sets. That is, if the damped nodes form a zero forcing set in the graph, then a richly balanced coloring does not exist and thus, parameter-independent stability is guaranteed. However, the full equivalence of zero forcing sets and parameter-independent stability holds only true for tree graphs. For more general graphs with few fundamental cycles an algorithm, named chord node coloring, is proposed that significantly outperforms a brute-force search for solving the NP-complete RBC problem.Comment: 30 pages, accepted for publication in SICO

Data based identification and prediction of nonlinear and complex dynamical systems

We thank Dr. R. Yang (formerly at ASU), Dr. R.-Q. Su (formerly at ASU), and Mr. Zhesi Shen for their contributions to a number of original papers on which this Review is partly based. This work was supported by ARO under Grant No. W911NF-14-1-0504. W.-X. Wang was also supported by NSFC under Grants No. 61573064 and No. 61074116, as well as by the Fundamental Research Funds for the Central Universities, Beijing Nova Programme.Peer reviewedPostprin

IEEE Access Special Section Editorial: Recent Advances on Hybrid Complex Networks: Analysis and Control

Complex networks typically involve multiple disciplines due to network dynamics and their statistical nature. When modeling practical networks, both impulsive effects and logical dynamics have recently attracted increasing attention. Hence, it is of interest and importance to consider hybrid complex networks with impulsive effects and logical dynamics. Relevant research is prevalent in cells, ecology, social systems, and communication engineering. In hybrid complex networks, numerous nodes are coupled through networks and their properties usually lead to complex dynamic behaviors, including discrete and continuous dynamics with finite values of time and state space. Generally, continuous and discrete sections of the systems are described by differential and difference equations, respectively. Logical networks are used to model the systems where time and state space take finite values. Although interesting results have been reported regarding hybrid complex networks, the analysis methods and relevant results could be further improved with respect to conservative impulsive delay inequalities and reproducibility of corresponding stability or synchronization criteria. Therefore, it is necessary to devise effective approaches to improve the analysis method and results dealing with hybrid complex networks

Synchronization in output-coupled temporal Boolean networks

The authors acknowledge the National Natural Science Foundation of China under Grant 61175119, Grant 61272530 and Grant 61203235, and IRTG 1740 (DFG and FAPESP). This publication was made possible by NPRP grant #NPRP 4-1162-1-181 from the QatarPeer reviewedPublisher PD