A multiplicative ergodic theorem for lipschitz maps
If (Fn, n [greater-or-equal, slanted] 0) is a stationary (ergodic) sequence of Lipschitz maps of a locally compact Polish space X into itself having a.s. negative Lyapunov exponent function, the composition process Fn...F1x converges in distribution to a stationary (ergodic) process in X (independent of x). For every x, the empirical distribution of a trajectory converges with probability one, and for every [var epsilon]>0, almost every trajectory is eventually within [var epsilon] of the support. We use the fact that the Lyapunov exponent of a process "run backwards" is the same as forwards. A set invariance condition is given for the case when (Fn) is a Markov chain. The result has applications to computer graphics and stability in control theory.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 34 (1990)
Issue (Month): 1 (February)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description|
|Order Information:|| Postal: http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:34:y:1990:i:1:p:39-47. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.