On the conversion of multivalued to Boolean dynamics

DOI10.1016/J.DAM.2018.10.045zbMATH Open1411.92123arXiv1703.06746OpenAlexW2905540714WikidataQ128346832 ScholiaQ128346832MaRDI QIDQ1735690FDOQ1735690

Authors: Elisa Tonello 

Publication date: 28 March 2019

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

Abstract: Results and tools on discrete interaction networks are often concerned with Boolean variables, whereas considering more than two levels is sometimes useful. Multivalued networks can be converted to partial Boolean maps, in a way that preserves the asynchronous dynamics. We investigate the problem of extending these maps to non-admissible states, i.e. states that do not have a multivalued counterpart. We observe that attractors are preserved if a stepwise version of the original function is considered for conversion. Different extensions of the Boolean conversion affect the structure of the interaction graphs in different ways. A particular technique for extending the partial Boolean conversion is identified, that ensures that feedback cycles are preserved. This property, combined with the conservation of the asymptotic behaviour, can prove useful for the application of results and analyses defined in the Boolean setting to multivalued networks, and vice versa. As a first application, by considering the conversion of a known example for the discrete multivalued case, we create a Boolean map showing that the existence of a cyclic attractor and the absence of fixed points are compatible with the absence of local negative cycles. We then state a multivalued version of a result connecting mirror states and local feedback cycles.

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

Recommendations

• A circuit-preserving mapping from multilevel to Boolean dynamics
• Mapping multivalued onto Boolean dynamics
• On circuit functionality in Boolean networks
• Negative local feedbacks in Boolean networks
• Local cycles and dynamical properties of Boolean networks

zbMATH Keywords

discrete dynamical systeminteraction networknegative cyclepositive cycle

Mathematics Subject Classification ID

Applications of graph theory (05C90) Systems biology, networks (92C42)

Cites Work

• A circuit-preserving mapping from multilevel to Boolean dynamics
• A combinatorial analogue of the Jacobian problem in automata networks
• Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
• Necessary conditions for multistationarity in discrete dynamical systems
• Mapping multivalued onto Boolean dynamics
• Negative circuits and sustained oscillations in asynchronous automata networks
• Title not available (Why is that?)
• Petri net representation of multi-valued logical regulatory graphs
• Negative local feedbacks in Boolean networks
• Local cycles and dynamical properties of Boolean networks
• An extension of a combinatorial fixed point theorem of Shih and Dong

Cited In (4)

• From multivalued to Boolean functions: preservation of soft nested canalization
• Local negative circuits and cyclic attractors in Boolean networks with at most five components
• A circuit-preserving mapping from multilevel to Boolean dynamics
• Mapping multivalued onto Boolean dynamics

Uses Software

• multi2boolean

This page was built for publication: On the conversion of multivalued to Boolean dynamics

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