Basins of attraction in fully asynchronous discrete-time discrete-state dynamic networks.
This paper gives a formulation of the basins of fixed point states of fully asynchronous discrete-time discrete-state dynamic networks. That formulation provides two advantages. The first one is to point out the different behaviors between synchronous and asynchronous modes and the second one is to allow us to easily deduce an algorithm which determines the behavior of a network for a given initialization. In the context of this study, we consider networks of a large number of neurons (or units, processors, etc.), whose dynamic is fully asynchronous with overlapping updates. We suppose that the neurons take a finite number of discrete states and that the updating scheme is discrete in time. We make no hypothesis on the activation functions of the nodes, so that the dynamic of the network may have multiple cycles and/or basins. Our results are illustrated on a simple example of a fully asynchronous Hopfield neural network.
Laboratoire d'Informatique de L'Université de Franche-Comté, IUT Belfort-Montbéliard, 90016 Belfort, France. bahi@iut-bm.univ-fcomte.fr
Jacques M
JM
Bahi
Sylvain
S
Contassot-Vivier
D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D003661:Decision Support Techniques; D008962:Models, Theoretical; D016571:Neural Networks, Computer; D009716:Numerical Analysis, Computer-Assisted; D010363:Pattern Recognition, Automated / Q000379:methods*