作者: Björn Samuelsson , Carl Troein
DOI: 10.1103/PHYSREVLETT.90.098701
关键词:
摘要: The Kauffman model describes a particularly simple class of random Boolean networks. Despite the simplicity model, it exhibits complex behavior and has been suggested as for real world network problems. We introduce novel approach to analyzing attractors in networks, applying networks we prove that average number grows faster than any power law with system size.