Hostname: page-component-6bb9c88b65-g7ldn Total loading time: 0 Render date: 2025-07-24T08:41:50.051Z Has data issue: false hasContentIssue false

Recursive algorithms, urn processes andchaining number of chain recurrent sets

Published online by Cambridge University Press:  01 February 1998

MICHEL BENAÏM
Affiliation:
Department of Mathematics, Université Paul Sabatier, Toulouse, France

Abstract

This paper investigates the dynamical properties of a class of urn processesand recursive stochastic algorithms with constant gain which arise frequentlyin control, pattern recognition, learning theory, and elsewhere.

It is shown that, under suitable conditions, invariant measures of theprocess tend to concentrate on the Birkhoff center of irreducible (i.e.chain transitive) attractors of some vector field $F: {\Bbb R}^d \rightarrow{\Bbb R}^d$ obtained by averaging. Applications are given to simplesituations including the cases where $F$ is Axiom A or Morse–Smale, $F$isgradient-like, $F$ is a planar vector field, $F$ has finitely many alpha andomega limit sets.

Information

Type
Research Article
Copyright
1998 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable