Trapping and commutative Boolean networks

DOI10.61091/JCMCC131-18MaRDI QIDQ7315689zbMATH OpenFDO

Authors Maximilien Gadouleau

Publication date 18 August 2026

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/JCMCC131-18

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Cellular automata (computational aspects) (68Q80) Deterministic network models in operations research (90B10)

Cites work

• A general model of binary opinions updating
• A model of influence based on aggregation functions
• Commutative automata networks
• Computing maximal and minimal trap spaces of Boolean networks
• Dynamics of positive automata networks
• Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks
• Fixed points and maximal independent sets in AND-OR networks
• Fixing monotone Boolean networks asynchronously
• scientific article; zbMATH DE number 3227055 (Why is no real title available?)
• Itérations sur des ensembles finis et automates cellulaires contractants
• Local negative circuits and fixed points in non-expansive Boolean networks
• Maximum number of fixed points in AND-OR-NOT networks
• Number of fixed points and disjoint cycles in monotone Boolean networks
• On the influence of the interaction graph on a finite dynamical system
• On the stability and instability of finite dynamical systems with prescribed interaction graphs
• Synchronizing Boolean networks asynchronously

This page was built for publication: Trapping and commutative Boolean networks

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