Dynamical properties of min-max networks

In this paper we study the dynamical behavior of a class of neural networks where the local transition rules are max or min functions. We prove that sequential updates define dynamics which reach the equilibrium in O(n2) steps, where n is the size of the network. For synchronous updates the equilibrium is reached in O(n) steps. It is shown that the number of fixed points of the sequential update is at most n. Moreover, given a set of p < or = n vectors, we show how to build a network of size n such that all these vectors are fixed points.