SIMPLIFYING BOOLEAN NETWORKS

DOI10.1142/S0219525905000518zbMath1109.37054OpenAlexW2096412361MaRDI QIDQ3373074

Kurt A. Richardson

Publication date: 13 March 2006

Published in: Advances in Complex Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219525905000518

zbMATH Keywords

attractorssimulationreductionphase spaceBoolean networkscomplexity theorysimplificationdecimationKauffman networks

Mathematics Subject Classification ID

Circuits, networks (94C99) Equilibrium statistical mechanics (82B99) Simulation of dynamical systems (37M05)

Related Items (6)

Reducing Boolean networks with backward Boolean equivalence ⋮ بررسی موردی حساسیت و توپولوژی گرههای شبکههای بولی کاهشیافته ⋮ Entropy analysis of Boolean network reduction according to the determinative power of nodes ⋮ Attractor analysis of asynchronous Boolean models of signal transduction networks ⋮ \(l_{1}\)-gain analysis and model reduction problem for Boolean control networks ⋮ FINDING ATTRACTORS IN ASYNCHRONOUS BOOLEAN DYNAMICS

Cites Work

• Closing probabilities in the Kauffman model: An annealed computation
• Relevant elements, magnetization and dynamical properties in Kauffman networks: A numerical study
• The modular structure of Kauffman networks
• Attraction basins in discretized maps
• Unnamed Item
• Unnamed Item

This page was built for publication: SIMPLIFYING BOOLEAN NETWORKS