IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v98y2017icp63-71.html
   My bibliography  Save this article

The Ergodic Theorem for a new kind of attractor of a GIFS

Author

Listed:
  • Oliveira, Elismar R.

Abstract

In 1987, Elton [11], has proved the first fundamental result on the convergence of IFS, the Elton’s Ergodic Theorem. In this work we prove the natural extension of this theorem to the projected Hutchinson measure μα associated to a GIFSpdp S=(X,(ϕj:Xm→X)j=0,1,…,n−1,(pj)j=0,1,…,n−1), in a compact metric space (X, d). More precisely, the average along of the trajectories xn(a) of the GIFS, starting in any initial points x0,…,xm−1∈X satisfies, for any f∈C(X,R),limN→+∞1N∑n=0N−1f(xn(a))=∫Xf(t)dμα(t),for almost all a∈Ω={0,1,…,n−1}N, the symbolic space. Additionally, we give some examples and applications to Chaos Games and Nonautonomous Dynamical Systems defined by finite difference equations.

Suggested Citation

  • Oliveira, Elismar R., 2017. "The Ergodic Theorem for a new kind of attractor of a GIFS," Chaos, Solitons & Fractals, Elsevier, vol. 98(C), pages 63-71.
    • Handle: RePEc:eee:chsofr:v:98:y:2017:i:c:p:63-71
    DOI: 10.1016/j.chaos.2017.03.016
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077917300656
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2017.03.016?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dumitru, Dan & Ioana, Loredana & Sfetcu, Răzvan-Cornel & Strobin, Filip, 2015. "Topological version of generalized (infinite) iterated function systems," Chaos, Solitons & Fractals, Elsevier, vol. 71(C), pages 78-90.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Abraham, Izabella & Miculescu, Radu & Mihail, Alexandru, 2024. "Relational generalized iterated function systems," Chaos, Solitons & Fractals, Elsevier, vol. 182(C).
    2. Miculescu, Radu & Mihail, Alexandru & Urziceanu, Silviu-Aurelian, 2020. "Contractive affine generalized iterated function systems which are topologically contracting," Chaos, Solitons & Fractals, Elsevier, vol. 141(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:98:y:2017:i:c:p:63-71. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.