Complex Dynamical Behavior in Nearly Symmetric Standard Cellular Neural Networks

Author(s):  
Mauro Forti ◽  
Alberto Tesi
2000 ◽  
Vol 10 (06) ◽  
pp. 1267-1293 ◽  
Author(s):  
M. DI MARCO ◽  
A. TESI ◽  
M. FORTI

When the neuron interconnection matrix is symmetric, the standard Cellular Neural Networks (CNN's) introduced by Chua and Yang [1988a] are known to be completely stable, that is, each trajectory converges towards some stationary state. In this paper it is shown that the interconnection symmetry, though ensuring complete stability, is not in the general case sufficient to guarantee that complete stability is robust with respect to sufficiently small perturbations of the interconnections. To this end, a class of third-order CNN's with competitive (inhibitory) interconnections between distinct neurons is introduced. The analysis of the dynamical behavior shows that such a class contains nonsymmetric CNN's exhibiting persistent oscillations, even if the interconnection matrix is arbitrarily close to some symmetric matrix. This result is of obvious relevance in view of CNN's implementation, since perfect interconnection symmetry in unattainable in hardware (e.g. VLSI) realizations. More insight on the behavior of the CNN's here introduced is gained by discussing the analogies with the dynamics of the May and Leonard model of the voting paradox, a special Volterra–Lotka model of three competing species. Finally, it is shown that the results in this paper can also be viewed as an extension of previous results by Zou and Nossek for a two-cell CNN with opposite-sign interconnections between distinct neurons. Such an extension has a significant interpretation in the framework of a general theorem by Smale for competitive dynamical systems.


1994 ◽  
Vol 05 (03) ◽  
pp. 241-252 ◽  
Author(s):  
ERIC GOLES ◽  
MARTÍN MATAMALA

We present dynamical results concerning neural networks with high order arguments. More precisely, we study the family of block-sequential iteration of neural networks with polynomial arguments. In this context, we prove that, under a symmetric hypothesis, the sequential iteration is the only one of this family to converge to fixed points. The other iteration modes present a highly complex dynamical behavior: non-bounded cycles and simulation of arbitrary non-symmetric linear neural network.5 We also study a high order memory iteration scheme which accepts an energy functional and bounded cycles in the size of the memory steps.


2008 ◽  
Vol 18 (05) ◽  
pp. 1343-1361 ◽  
Author(s):  
MAURO DI MARCO ◽  
MAURO FORTI ◽  
ALBERTO TESI

In this paper, the dynamical behavior of a class of third-order competitive cellular neural networks (CNNs) depending on two parameters, is studied. The class contains a one-parameter family of symmetric CNNs, which are known to be completely stable. The main result is that it is a generic property within the family of symmetric CNNs that complete stability is robust with respect to (small) nonsymmetric perturbations of the neuron interconnections. The paper also gives an exact evaluation of the complete stability margin of each symmetric CNN via the characterization of the whole region in the two-dimensional parameter space where the CNNs turn out to be completely stable. The results are established by means of a new technique to investigate trajectory convergence of the considered class of CNNs in the nonsymmetric case.


2007 ◽  
Vol 17 (09) ◽  
pp. 3127-3150 ◽  
Author(s):  
M. DI MARCO ◽  
M. FORTI ◽  
M. GRAZZINI ◽  
P. NISTRI ◽  
L. PANCIONI

In a series of papers published in the seventies, Grossberg had developed a geometric approach for analyzing the global dynamical behavior and convergence properties of a class of competitive dynamical systems. The approach is based on the property that it is possible to associate a decision scheme with each competitive system in that class, and that global consistency of the decision scheme implies convergence of each solution toward some stationary state. In this paper, the Grossberg approach is extended to the class of competitive standard Cellular Neural Networks (CNNs), and it is used to investigate convergence under the hypothesis that the competitive CNN has a globally consistent decision scheme. The extension is nonobvious and requires to deal with the set-valued vector field describing the dynamics of the CNN output solutions. It is also stressed that the extended approach does not require the existence of a Lyapunov function, hence it is applicable to address convergence in the general case where the CNN neuron interconnections are not necessarily symmetric. By means of the extended approach, a number of classes of third-order nonsymmetric competitive CNNs are discovered, which have a globally consistent decision scheme and are convergent. Moreover, global consistency and convergence hold for interconnection parameters belonging to sets with non-empty interior, and thus they represent physically robust properties. The paper also shows that when the dimension is higher than three, there are fundamental differences between the convergence properties of competitive CNNs implied by a globally consistent decision scheme, and those of the class of competitive dynamical systems considered by Grossberg. These differences lead to the need to introduce a stronger notion of global consistency of decisions, with respect to that proposed by Grossberg, in order to guarantee convergence of competitive CNNs with more than three neurons.


2020 ◽  
pp. 1-13
Author(s):  
Kun Deng ◽  
Song Zhu ◽  
Wei Dai ◽  
Chunyu Yang ◽  
Shiping Wen

Sign in / Sign up

Export Citation Format

Share Document