Attractor Analysis of Conjunctive Boolean Networks via Dependency Graph
作者单位：School of Mathematics and StatisticsShandong Normal University
会议名称：《第43届中国控制会议》
会议日期：1000年
学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学]
基 金：supported by the National Natural Science Foundation of China under grant 62073202 the Young Experts of Taishan Scholar Project under grant tsqn201909076
关 键 词：Conjunctive Boolean network Attractor Set stability Adjacency matrix Loop number
摘 要：Graph theory is an effective method to analyze the network structure of Boolean *** on the dependency graph,this paper focuses on the cyclic structure of conjunctive Boolean networks(CBNs).Firstly,it is proved that the length of any limit cycle divides the loop number,and it reveals that the attractor of CBNs only contains fixed points if and only if the loop number of the dependency graph is ***,with the help of adjacency matrix,the transition period is determined when the CBN reaches the set ***,based on the relationship between the power of adjacency matrix,the loop number of dependency graph and network iteration,a method is proposed to find the fixed point and limit cycle of ***,an example is given to show the effectiveness of the main results.