Abstract
An iterated function system (IFS) on a compact metric space is a finite collection of mappings of the space into itself. Under suitable conditions, an attractor for the IFS can be defined in a natural way. If the mappings depend on a parameter, the subset of the parameter space for wich the corresponding attractor is connected is called the Mandelbrot set of the family. Under some suitable symmetry conditions, it can be shown that, for parameter values not in the Mandelbrot set, the attractor is homeomorphic to the Cantor set. We determine the Mandelbrot set for a family of nonlinear IFS’s on the unit triangle obtained from the problem of filtering the noise from a Markov chain signal model.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliography
M.F. Barnsley. Fractals Everywhere. Academic Press, New York, 1989.
M.F. Barnsley and S.G. Demko. Iterated function systems and the global construction of fractals. Proc. Roy. Soc. London, A(399):243–275,1985.
M.F. Barnsley, S.G. Demko, J.H. Elton, and J.S. Geronimo. Invariant measures for Markov processes arising from iterated function systems with place-dep. prob. Ann. Inst. Henri Poincaré, 24:367–394,1988. •
W. Doeblin and R. Fortet. Sur les chaînes à liaisons complètes. Bull. Soc. Math. France, 65:132–148,1937.
J.H. Elton and M. Piccioni. Iterated function system arising from recursive estimation problems. Submitted, 1991.
H. Furstenberg and V. Kifer. Random matrix products and measures on projective spaces. Israël J. Math., 46:12–32,1983.
M. Hata. On the structure of self-similar sets. Japan J. Appl. Math., 2:381–414,1985.
J.E. Hutchinson. Fractals and self-similarity. Indiana Univ. Math. J., 30:713–747,1981.
M. Iosifescu and Theodorescu. R. Random Processes and Learning. Springer-Verlag, New York, 1969.
S. Karlin. Some random walks arising in learning models. Proc. J. Math., 3:725–756,1953.
J. Lamperti and P. Suppes. Chains of infinite order and their application to learning theory. Proc. J. Math., 15:739–754,1959.
O. Onicescu and G. Mihoc Sur les chaînes statistiques. C.R. Acad. Sci. Paris, 200:511–512,1935.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Piccioni, M., Regoli, M. (1992). The geometry of attractors for a class of iterated function systems. In: Byrnes, J.S., Byrnes, J.L., Hargreaves, K.A., Berry, K. (eds) Probabilistic and Stochastic Methods in Analysis, with Applications. NATO ASI Series, vol 372. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-2791-2_34
Download citation
DOI: https://doi.org/10.1007/978-94-011-2791-2_34
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-5239-9
Online ISBN: 978-94-011-2791-2
eBook Packages: Springer Book Archive