Abstract
A set of contraction maps of a metric space is called an iterated function systems. Iterated function systems with condensation can be considered infinite iterated function systems. Infinite iterated function systems on compact metric spaces were studied. Using the properties of Banach limit and uniform contractiveness, it was proved that the random iterating algorithms for infinite iterated function systems on compact metric spaces satisfy ergodicity. So the random iterating algorithms for iterated function systems with condensation satisfy ergodicity, too.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barnsley M.Fractals Everywhere [M]. Academic Press, New York, 1988.
O Hyong-chol. Generalized iterated function systems [J].Bulletin of Academy D P R of Korea, 2001,287(5): 3–5 (in Korean)
Elton J. An ergodic theorem for iterated maps[J].Ergodic Theory and Dynamical Systems, 1987,7(4):481–488.
Forte B, Mendivil F. A classical ergodic property for IFS: A simple proof[J].Ergodic Theory and Dynamical Systems, 1998,18(3):609–611.
Ma Dongkui, Zhou Zuoling. Ergodic properties for IFS—the improvement of Elton theorem[J].Mathematica Applicata, 2001,14(4):46–50 (in Chinese).
Mendivil F. A generalization of IFS with probability to infinitely many maps[J].Rocky Mountain Journal of Mathematics, 1998,28(3):1043–1051.
Conway John.A Course of Functional Analysis [M]. GTM 96, Springer-Verlag, 1990.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by LIU Zeng-rong
Rights and permissions
About this article
Cite this article
Hyong-Chol, O., Yong-hwa, R. & Won-gun, K. Ergodic theorem for infinite iterated function systems. Appl Math Mech 26, 465–469 (2005). https://doi.org/10.1007/BF02465385
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02465385