A NUMERICAL INVESTIGATION OF THE CRITICAL PHASE OF RANDOM BOOLEAN NETWORKS
Abstract
Our numerical simulation first displays exponential increase of the mean number of attractors with N for K = 2,3,4 and 50≦ N ≦350. The mean length of attractors also increases exponentially with N for K = 2, but increases linearly with N for K = 3,4. We further found the larger the K the larger S/N value; which yields the results that the mean length and the mean number of attractors of critical random Boolean networks will decrease with larger K.