Stability analysis of Boolean networks: An eigenvalue approach

Abstract

This article investigates the stability of probabilistic Boolean networks (PBNs) and switched Boolean networks (SBNs). To begin with, a unique Boolean network is presented with both stochastic signal and switching signal. It is then converted to algebraic form using semi-tensor product. An important concept named “existed path” is proposed, and further a novel method based on eigenvalue and trace-based method is used to derive some necessary and sufficient stability criteria for the first time. Moreover, these criteria are extended to include ordinary PBNs and SBNs. Finally, several examples are given to illustrate the main results.