On limit cycles of monotone functions with symmetric connection graph
From MaRDI portal
Publication:1885914
DOI10.1016/j.tcs.2004.03.010zbMath1068.68097OpenAlexW2090362493MaRDI QIDQ1885914
Jacques Demongeot, Julio Aracena, Eric Goles Chacc
Publication date: 12 November 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.010
Related Items (16)
Cooperative Boolean systems with generically long attractors I ⋮ Ordered dynamics in biased and cooperative Boolean networks ⋮ Liénard systems and potential-Hamiltonian decomposition. II: Algorithm ⋮ Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks ⋮ About non-monotony in Boolean automata networks ⋮ Synchronism versus asynchronism in monotonic Boolean automata networks ⋮ Combinatorics of Boolean automata circuits dynamics ⋮ The maximal coordination principle in regulatory Boolean networks ⋮ Unnamed Item ⋮ A model of influence based on aggregation functions ⋮ Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework ⋮ Synchrony in reaction–diffusion models of morphogenesis: applications to curvature-dependent proliferation and zero-diffusion front waves ⋮ A general model of binary opinions updating ⋮ An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks ⋮ ``Immunetworks, intersecting circuits and dynamics ⋮ LINEAR AND NONLINEAR ARABESQUES: A STUDY OF CLOSED CHAINS OF NEGATIVE 2-ELEMENT CIRCUITS
Cites Work
This page was built for publication: On limit cycles of monotone functions with symmetric connection graph
