An ergodic theorem for iterated maps (Q3757068)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4007351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An ergodic theorem for iterated maps |
scientific article; zbMATH DE number 4007351 |
Statements
An ergodic theorem for iterated maps (English)
0 references
1987
0 references
applications to computer graphics
0 references
ergodic
0 references
invariant measure
0 references
randomly iterated maps
0 references
0 references
0.92526525
0 references
0 references
0 references
0.9183613
0 references
0 references
Consider a Markov process on a locally compact metric space arising from iteratively applying maps chosen randomly from a finite set of Lipschitz maps which, on the average, contract between any two points (no map need be a global contraction). The distribution of the maps is allowed to depend on current position, with mild restrictions. Such processes have unique stationary initial distribution. We show that, starting at any point, time averages along trajectories of the process converge almost surely to a constant independent of the starting point. This has applications to computer graphics.
0 references