# American Institute of Mathematical Sciences

October  2020, 40(10): 5765-5793. doi: 10.3934/dcds.2020245

## On the effects of firing memory in the dynamics of conjunctive networks

 1 Facultad de Ingeniería y Ciencias, Universidad Adolfo Ibáñez, Diagonal las Torres 2650, Peñalolen, Santiago, Chile, and, Unconventional Computing Laboratory, University of the West of England, Bristol, UK 2 Facultad de Ingeniería y Ciencias, Universidad Adolfo Ibáñez, Diagonal las Torres 2650, Peñalolen, Santiago, Chile 3 Departamento de Ingeniería Matemática, Facultad de Ciencias Físicas y Matemáticas, Universidad de Chile, Beauchef 851, Torre Norte, Piso 5, Santiago, Chile, and, Aix Marseille Univ, Université de Toulon, CNRS, LIS, Marseille, France

* Corresponding author: Pedro Montealegre

Some of the results of this paper have been presented in the 25th International Workshop on Cellular Automata and Discrete Complex Systems AUTOMATA 2019.

Received  July 2019 Revised  February 2020 Published  June 2020

A boolean network is a map $F:\{0,1\}^n \to \{0,1\}^n$ that defines a discrete dynamical system by the subsequent iterations of $F$. Nevertheless, it is thought that this definition is not always reliable in the context of applications, especially in biology. Concerning this issue, models based in the concept of adding asynchronicity to the dynamics were propose. Particularly, we are interested in a approach based in the concept of delay. We focus in a specific type of delay called firing memory and it effects in the dynamics of symmetric (non-directed) conjunctive networks. We find, in the caseis in which the implementation of the delay is not uniform, that all the complexity of the dynamics is somehow encapsulated in the component in which the delay has effect. Thus, we show, in the homogeneous case, that it is possible to exhibit attractors of non-polynomial period. In addition, we study the prediction problem consisting in, given an initial condition, determinate if a fixed coordinate will eventually change its state. We find again that in the non-homogeneous case all the complexity is determined by the component that is affected by the delay and we conclude in the homogeneous case that this problem is PSPACE-complete.

Citation: Eric Goles, Pedro Montealegre, Martín Ríos-Wilson. On the effects of firing memory in the dynamics of conjunctive networks. Discrete & Continuous Dynamical Systems - A, 2020, 40 (10) : 5765-5793. doi: 10.3934/dcds.2020245
##### References:

show all references

##### References:
Symmetric conjunctive network ($F(x_0,x_1,x_2) = (x_1\land x_2, x_0\land x_2, x_0 \land x_1)$) dynamics in three vertices
Symmetric AND ($F(x_0,x_1,x_2) = (x_1\land x_2, x_0\land x_2, x_0 \land x_1)$) dynamics with firing memory $dt_i = 2, \text{ } i = 0,1,2$ in three vertices
Structure of a network $G^{\tau,k}$ in which the connected component $D$ has maximum delay $\tau \geq 2$ in every node and the connected component $G$ has maximum delay $\tau = 1$ in every node. Additionally, the subset $\partial$ contains every node in $D$ whose have a neighbour in $G$. (a).- The connected component $G$ has an arbiratry topology. (b).- The connected component $G$ is a bipartite graph. As it is shown in Proposition 1, the structure of $G$ may condition the existance of different type of attractors for a conjunctive network
A scheme of the dynamics of a node $i \in \partial$ that is in state 0 in some time step t. Note that before the sequence of states Ï„; Ï„ âˆ' 1;...; 0 we donâ€™t know the state of i and we note it as? in order to illustrate this situation. As a consequence of the fact that the maximum delay Ï„ is even together with the fact that two nodes in state 0 can not be neighbours we have that there are no attractor different from the fixed points $\overrightarrow 1$ and $\overrightarrow 0$.
(a) A network $G^{\tau,k}$ with maximum delay $\tau = 3$ and $10$ nodes exhibiting an attractor of period $8$. This network is defined by connecting the network $D$ (squares and non-colored circles) to a component with maximum delay $\tau = 1$ in every vertex (gray nodes). The nodes $1$ and $2$ (in grey) are the only nodes in $G^{\tau,k}$ with maximum delay $\tau = 1$. In addition, nodes represented by squares and non-coloured circles have maximum delay $\tau = 3$. Finally, nodes represented by squares are the nodes in the interface between the component $D$ and $G$ (we called this set $\partial$ in the latter section), and nodes represented by non-coloured circles are the ones that have no neighbours in $G$. (b) Configuration of an attractor with period $8$ defined over the network showed in (a)
Attractors with period $p = \tau +1$ for $\tau = 2$ and $\tau = 3$
Structure of the $j$-th block used in Proposition 5 to define a conjunctive network with firing memory and maximum delay values $dt_i = \tau$ for every node $i$ that admits attractors with period $k(\tau+1)$. Every circle in the figure represents clock $C(B_j)_{r,l}$ associated to a node $r$ represented by a square. This gadget has $\tau + 1$ nodes and every node has $\tau -1$ clocks
Initial condition for the j-th block, j â‰¥ 2 used in Proposition 5 to define an attractor with period k(Ï„ + 1): For the first block we just define the state of the first node to 0 instead of Ï„.
Interaction graph G associated to a conjunctive network with firing memory and maximum delay dti = Ï„ for all $i \in V\left( G \right)$, defined in Proposition 5 that admits attractors with length k(Ï„ + 1).
Structure of a block used in Proposition 5 to define a conjunctive network with firing memory and maximum delay values $dt_i = \tau$ for every node $i$ that admits attractors with period $k(\tau+1)$. Every circle in the figure represents clock associated to a node $r$ represented by a square. This gadget has $\tau + 1$ nodes and every node has $\tau -1$ clocks
Interaction graph $G$ associated to a conjunctive network with firing memory and maximum delay values $dt_i = \tau$ for every node $i \in V(G)$ that admits attractors with non polynomial period. Every component defines a local dynamics with period $(\tau + 1) p_i$. Initial condition is defined verifying that there are no connected nodes in $0$. Global period of the network is given by the product of prime numbers $p_i$.
Interaction graph associated to a conjunctive network with firing memory and maximum delay vector $dt_i = 2$ for every node $i$ that simulates an iterated monotone boolean circuit $C$. Layers are made up by AND or OR gates exclusively, using the gadgets shown in Figure 13 and Figure 14 are alternately ordered
Gadget of AND gates used in the graph shown in Figure 12. Signals are transmitted and coded based on the block gadget
Gadget of OR gates used in the graph shown in Figure 12. Signals are transmitted and coded based on the block gadget
Iterations of the AND gate gadget. A $0$ and a $1$ are computed as inputs. After seven steps the information is transmitted and initial condition is recovered.
Iterations of the OR gate gadget. A $0$ and a $1$ are computed as inputs. After three steps the information is transmitted and the initial condition is recovered.
 [1] Javier Fernández, Cora Tori, Marcela Zuccalli. Lagrangian reduction of nonholonomic discrete mechanical systems by stages. Journal of Geometric Mechanics, 2020, 12 (4) : 607-639. doi: 10.3934/jgm.2020029 [2] Yuri Fedorov, Božidar Jovanović. Continuous and discrete Neumann systems on Stiefel varieties as matrix generalizations of the Jacobi–Mumford systems. Discrete & Continuous Dynamical Systems - A, 2020  doi: 10.3934/dcds.2020375 [3] Qiang Fu, Yanlong Zhang, Yushu Zhu, Ting Li. Network centralities, demographic disparities, and voluntary participation. Mathematical Foundations of Computing, 2020, 3 (4) : 249-262. doi: 10.3934/mfc.2020011 [4] D. R. Michiel Renger, Johannes Zimmer. Orthogonality of fluxes in general nonlinear reaction networks. Discrete & Continuous Dynamical Systems - S, 2021, 14 (1) : 205-217. doi: 10.3934/dcdss.2020346 [5] Bernold Fiedler. Global Hopf bifurcation in networks with fast feedback cycles. Discrete & Continuous Dynamical Systems - S, 2021, 14 (1) : 177-203. doi: 10.3934/dcdss.2020344 [6] Shipra Singh, Aviv Gibali, Xiaolong Qin. Cooperation in traffic network problems via evolutionary split variational inequalities. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020170 [7] Jiahao Qiu, Jianjie Zhao. Maximal factors of order $d$ of dynamical cubespaces. Discrete & Continuous Dynamical Systems - A, 2021, 41 (2) : 601-620. doi: 10.3934/dcds.2020278 [8] Fanni M. Sélley. A self-consistent dynamical system with multiple absolutely continuous invariant measures. Journal of Computational Dynamics, 2021, 8 (1) : 9-32. doi: 10.3934/jcd.2021002 [9] Barbora Benešová, Miroslav Frost, Lukáš Kadeřávek, Tomáš Roubíček, Petr Sedlák. An experimentally-fitted thermodynamical constitutive model for polycrystalline shape memory alloys. Discrete & Continuous Dynamical Systems - S, 2020  doi: 10.3934/dcdss.2020459 [10] Manil T. Mohan. Global attractors, exponential attractors and determining modes for the three dimensional Kelvin-Voigt fluids with "fading memory". Evolution Equations & Control Theory, 2020  doi: 10.3934/eect.2020105 [11] Dan Zhu, Rosemary A. Renaut, Hongwei Li, Tianyou Liu. Fast non-convex low-rank matrix decomposition for separation of potential field data using minimal memory. Inverse Problems & Imaging, , () : -. doi: 10.3934/ipi.2020076 [12] Lars Grüne, Matthias A. Müller, Christopher M. Kellett, Steven R. Weller. Strict dissipativity for discrete time discounted optimal control problems. Mathematical Control & Related Fields, 2020  doi: 10.3934/mcrf.2020046 [13] Cuicui Li, Lin Zhou, Zhidong Teng, Buyu Wen. The threshold dynamics of a discrete-time echinococcosis transmission model. Discrete & Continuous Dynamical Systems - B, 2020  doi: 10.3934/dcdsb.2020339 [14] Veena Goswami, Gopinath Panda. Optimal customer behavior in observable and unobservable discrete-time queues. Journal of Industrial & Management Optimization, 2021, 17 (1) : 299-316. doi: 10.3934/jimo.2019112 [15] Min Chen, Olivier Goubet, Shenghao Li. Mathematical analysis of bump to bucket problem. Communications on Pure & Applied Analysis, 2020, 19 (12) : 5567-5580. doi: 10.3934/cpaa.2020251 [16] Qingfang Wang, Hua Yang. Solutions of nonlocal problem with critical exponent. Communications on Pure & Applied Analysis, 2020, 19 (12) : 5591-5608. doi: 10.3934/cpaa.2020253 [17] Stefano Bianchini, Paolo Bonicatto. Forward untangling and applications to the uniqueness problem for the continuity equation. Discrete & Continuous Dynamical Systems - A, 2020  doi: 10.3934/dcds.2020384 [18] Kien Trung Nguyen, Vo Nguyen Minh Hieu, Van Huy Pham. Inverse group 1-median problem on trees. Journal of Industrial & Management Optimization, 2021, 17 (1) : 221-232. doi: 10.3934/jimo.2019108 [19] Lingju Kong, Roger Nichols. On principal eigenvalues of biharmonic systems. Communications on Pure & Applied Analysis, 2021, 20 (1) : 1-15. doi: 10.3934/cpaa.2020254 [20] Leilei Wei, Yinnian He. A fully discrete local discontinuous Galerkin method with the generalized numerical flux to solve the tempered fractional reaction-diffusion equation. Discrete & Continuous Dynamical Systems - B, 2020  doi: 10.3934/dcdsb.2020319

2019 Impact Factor: 1.338