Combinatorics on update digraphs in Boolean networks

DOI10.1016/J.DAM.2010.10.010MaRDI QIDQ628333zbMATH OpenOpenAlexFDO

Authors E. Fanchon, Julio Aracena, Marco Montalva, Mathilde Noual

Publication date 10 March 2011

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2010.10.010

zbMATH Keywords

Boolean networkfeedback arc setupdate digraphupdate schedule

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Connectivity (05C40) Applications of graph theory (05C90)

Recommendations

• Limit cycles and update digraphs in Boolean networks
• On the number of different dynamics in Boolean networks with deterministic update schedules
• On the number of update digraphs and its relation with the feedback arc sets and tournaments
• Block-sequential update schedules and Boolean automata circuits
• Combinatorics of Boolean automata circuits dynamics

Cites work

• Discrete, sequential dynamical systems
• scientific article; zbMATH DE number 47903 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• ON ASYNCHRONOUS CELLULAR AUTOMATA
• Robustness and fragility of Boolean models for genetic regulatory networks

Cited in

(22)

• Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates
• Limit cycles and update digraphs in Boolean networks
• On the number of different dynamics in Boolean networks with deterministic update schedules
• Sequentialization and procedural complexity in automata networks
• From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority
• A spectral outlook on the elementary cellular automata with cyclic configurations and block-sequential asynchronous updates
• \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
• Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures
• Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations
• Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates
• On the number of update digraphs and its relation with the feedback arc sets and tournaments
• Block-sequential update schedules and Boolean automata circuits
• About non-monotony in Boolean automata networks
• Disjunctive networks and update schedules
• About block-parallel Boolean networks: a position paper
• Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations
• Attractor landscapes in Boolean networks with firing memory: a theoretical study applied to genetic networks
• Asynchronous, finite dynamical systems
• Complexity of limit cycles with block-sequential update schedules in conjunctive networks
• Asymptotic (a)synchronism sensitivity and complexity of elementary cellular automata
• Computational complexity of minimal trap spaces in Boolean networks
• Foundations of block-parallel automata networks

This page was built for publication: Combinatorics on update digraphs in Boolean networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628333)