00564nam a2200145 4500008004100000245011200041210006900153260003300222100002500255700002300280700001500303700001900318700002000337856006100357 2018 eng d00aUnifying Themes in Complex Systems IX: Proceedings of the Ninth International Conference on Complex Systems0 aUnifying Themes in Complex Systems IX Proceedings of the Ninth I aCambridge, MA, USAbSpringer1 aMorales, Alfredo, J.1 aGershenson, Carlos1 aBraha, Dan1 aMinai, Ali, A.1 aBar-Yam, Yaneer uhttps://link.springer.com/book/10.1007/978-3-319-96661-801111nas a2200181 4500008004100000245007400041210006900115260001400184300001400198520057100212100002300783700001600806700001400822700001700836700001600853700001900869856004100888 2004 eng d00aUpdating Schemes in Random {Boolean} Networks: Do They Really Matter?0 aUpdating Schemes in Random Boolean Networks Do They Really Matte bMIT Press a238–2433 aIn this paper we try to end the debate concerning the suitability of different updating schemes in random Boolean networks (RBNs). We quantify for the first time loose attractors in asyncrhonous RBNs, which allows us to analyze the complexity reduction related to different updating schemes. We also report that all updating schemes yield very similar critical stability values, meaning that the "edge of chaos" does not depend much on the updating scheme. After discussion, we conclude that synchonous RBNs are justifiable theoretical models of biological networks.1 aGershenson, Carlos1 aPollack, J.1 aBedau, M.1 aHusbands, P.1 aIkegami, T.1 aWatson, R., A. uhttp://arxiv.org/abs/nlin.AO/0402006