Classification of random boolean networks Export

@inproceedings{citeulike:5301228, abstract = {We provide the first classification of different types of Random Boolean Networks (RBNs). We study the differences of RBNs depending on the degree of synchronicity and determinism of their updating scheme. For doing so, we first define three new types of RBNs. We note some similarities and differences between different types of RBNs with the aid of a public software laboratory we developed. Particularly, we find that the point attractors are independent of the updating scheme, and that RBNs are more different depending on their determinism or non-determinism rather than depending on their synchronicity or asynchronicity. We also show a way of mapping non-synchronous deterministic RBNs into synchronous RBNs. Our results are important for justifying the use of specific types of RBNs for modelling natural phenomena.}, address = {Cambridge, MA, USA}, author = {Gershenson, Carlos}, booktitle = {ICAL 2003: Proceedings of the eighth international conference on Artificial life}, citeulike-article-id = {5301228}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=860297}, isbn = {0-262-69281-3}, pages = {1--8}, posted-at = {2009-07-30 10:25:06}, priority = {2}, publisher = {MIT Press}, title = {Classification of random boolean networks}, url = {http://portal.acm.org/citation.cfm?id=860297}, year = {2003} }

TY - CONF ID - citeulike:5301228 L3 - citeulike-article-id:5301228 N2 - We provide the first classification of different types of Random Boolean Networks (RBNs). We study the differences of RBNs depending on the degree of synchronicity and determinism of their updating scheme. For doing so, we first define three new types of RBNs. We note some similarities and differences between different types of RBNs with the aid of a public software laboratory we developed. Particularly, we find that the point attractors are independent of the updating scheme, and that RBNs are more different depending on their determinism or non-determinism rather than depending on their synchronicity or asynchronicity. We also show a way of mapping non-synchronous deterministic RBNs into synchronous RBNs. Our results are important for justifying the use of specific types of RBNs for modelling natural phenomena. SN - 0-262-69281-3 AD - Cambridge, MA, USA EP - 8 TI - Classification of random boolean networks PB - MIT Press T2 - ICAL 2003: Proceedings of the eighth international conference on Artificial life SP - 1 AU - Gershenson, Carlos PY - 2003/// UR - http://portal.acm.org/citation.cfm?id=860297 ER -