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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
