Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability

DOI10.1109/TIT.2016.2544344zbMath1359.94949arXiv1412.5310MaRDI QIDQ2976838

E. Fanchon, Maximilien Gadouleau, Adrien Richard

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.5310

Mathematics Subject Classification ID

Related Items (15)

Complexity of fixed point counting problems in Boolean networks ⋮ Fixed points in conjunctive networks and maximal independent sets in graph contractions ⋮ Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks ⋮ Finite Dynamical Systems, Hat Games, and Coding Theory ⋮ Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks ⋮ Synchronizing Boolean networks asynchronously ⋮ Attractor separation and signed cycles in asynchronous Boolean networks ⋮ On the influence of the interaction graph on a finite dynamical system ⋮ Fixing monotone Boolean networks asynchronously ⋮ Positive and negative cycles in Boolean networks ⋮ Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates ⋮ Fixed points and connections between positive and negative cycles in Boolean networks ⋮ On the rank and periodic rank of finite dynamical systems ⋮ On the stability and instability of finite dynamical systems with prescribed interaction graphs ⋮ Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules

This page was built for publication: Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability