Ali A. Sadeghi

• Here the almost sure convergence of one dimensional Kohonen" s algorithm in its general form, namely, 2k point neightbour setting with a non-uniform stimuli distribution is proved. We show that the asymptotic behaviour of the algorithm is governed by a cooperative system of differential equations which in general is irreducible. The system of differential equation has an asymptotically stable fixed point which a compact subset of its domain of attraction will be visited by the state variable Xn infinitely often.