Of the Complexity of Boolean Network State Trajectories

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    43 Downloads (Pure)

    Abstract

    We study the complexity of network dynamics in a couple of very different model classes: The traditional random Boolean networks (RBN) and Frisch-Hasslacher-Pomeau lattice gas automata (FHP). For this we formulate the FHP dynamics as a probabilistic Boolean network (PBN). We use the set complexity of successive network states to assess the complexity of the dynamics. We find that the complexity is maximised near a transition state in both types of dynamical systems.
    Original languageEnglish
    Title of host publicationEight International Workshop on Computational Systems Biology, WCSB 2011, June 6-8, Zurich, Switzerland. TICSP series
    EditorsHeinz Koeppl, Jugoslava Acimovic, Juha Kesseli, Tuomo Mäki-Marttunen, Antti Larjo, Olli Yli-Harja
    Place of PublicationZurich
    PublisherWCSB 2011
    Pages137-140
    ISBN (Print)978-952-15-2591-9
    Publication statusPublished - 2011
    Publication typeA4 Article in conference proceedings

    Publication series

    NameInternational Workshop on Computational Systems Biology WCSB
    Number57
    ISSN (Print)1456-2774

    Publication forum classification

    • Publication forum level 0

    Fingerprint

    Dive into the research topics of 'Of the Complexity of Boolean Network State Trajectories'. Together they form a unique fingerprint.

    Cite this