Bifurcation structure of a discrete neuronal equation
type: Item
instance of: scholarly article
title: Bifurcation structure of a discrete neuronal equation
zbMATH Open document ID: 0683.68047
DOI: 10.1016/0166-218X(88)90031-5
author: Michel Cosnard
author: Eric Goles
author: Driss Moumida
published in: Discrete Applied Mathematics
publication date: 1988-01-01T00:00:00Z
review text: The general equation \(x_{n+1}=\mathbf{1}(\theta -\sum_{0\leq i\leq n}a(i)x_{n-i})\) (where \(\mathbf{1}\) is the characteristic function of [0,\(\infty [\) in \({\mathbb{R}}\), \(\theta\in {\mathbb{R}}\), and a(i)\(\in {\mathbb{R}})\) was first proposed by \textit{E. R. Caianello} and \textit{A. de Luca} [Kybernetik 3, 33-40 (1966)] and, with \textit{L. Ricciardi} [Kybernetik 4 (1967)], to simulate the neural response taking into account of the refractary transition period. The particular case given by \(a(i)=b^ i\), \(0<b\leq 1/2\), was previously studied by \textit{T. Kitagawa} [Math. Biosci. 18, 191-244 (1973; Zbl 0272.92002)]. The authors investigate the bifurcation diagram arising from iterations of the k-steps memory transition A(k,\(\theta\),b) given by \[ x_{n+1}=\mathbf{1}(\theta - \sum_{0\leq i<k}b^ ix_{n-i}), \] which can be reduced to A(k,\(\lambda\),\()\) for a suitable \(\lambda\). The complete bifurcation structure is described. Put \(F_{\lambda}(x_ 0,...,x_{k- 1})=\mathbf{1} (\lambda -\sum_{0\leq i<k}x_ i/2^ i)\) and call a 0-1 string \(C=C_{T-1}..C_ 0\) (of length \(| C|:=T)\) admissible if there exist k and \(\lambda\) such that C is a cycle for A(k,\(\lambda\),\()\), i.e., \[ C_{n+1}=F_{\lambda}(C_ n...C_{n-k+1}),\quad n=0,...,T-1 \] (using indices modulo T). Admissible cycle are characterized (Theorem 1) by a max-min condition involving lexicographic order on the set of cyclic permutations of C. Let \(\tau_{r,0}\) be the substitution \(10^ r\to 0\), \(10^{r+1}\to 1\) and put \(\tau_{r,1}=1-\tau_{r,0}\). If C is a cycle for A(k,\(\lambda\),\()\), then \(| C| \leq k+1\) (Corollary 2) and there exist \((r_ 1,s_ 1),...,(r_ n,s_ n)\) such that \(\tau_{r_ n,s_ n}\circ...\circ \tau_{r_ 1,s_ 1}(C)=0\) (Corollary 3). More results are given, one of them concerns the rotation number \(\rho\) (C) of C defined as the ratio of the number of 1's over the length of C. Theorem 3: The map \(\rho\) : \(R\to {\mathbb{Q}}\) is monotonic, increasing and \(\rho\) (\({…
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 92B05
Mathematics Subject Classification ID: 92-04
zbMATH DE Number: 4119633
zbMATH Keywords: global attractor-bifurcation
zbMATH Keywords: neuron model
zbMATH Keywords: biomathematics
zbMATH Keywords: automaton
MaRDI profile type: Publication
cites work: Q3338991
cites work: Q3906149
cites work: Dynamical Behaviour of Neural Networks
cites work: Quantitative universality for a class of nonlinear transformations
cites work: Sur la conjugaison différentiable des difféomorphismes du cercle à des rotations. (On smooth conjugacy of diffeomorphisms of the circle with rotations)
cites work: Similarity structure and scaling property of the period-adding phenomena.
cites work: Chaotic Behavior in Piecewise Continuous Difference Equations
cites work: Dynamical systems and operators associated with a single neuronic equation
cites work: A logical calculus of the ideas immanent in nervous activity
cites work: Characterization of dynamical behavior associated with a single neural equation
cites work: On a response characteristic of a mathematical neuron model
cites work: Q3308751
cites work: Q3959791
cites work: Q3948911
full work available at URL: 0166-218x(88)90031-5
OpenAlex ID: W2051922929
description: scientific article; zbMATH DE number 4119633