System Upgrade on Tue, May 28th, 2024 at 2am (EDT)
Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
Results: 1 - 1of1
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
A NUMERICAL INVESTIGATION OF THE CRITICAL PHASE OF RANDOM BOOLEAN NETWORKS
Preview AbstractOur 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.