Skip to main content
Log in

Random Logistic Maps. I

  • Published:
Journal of Theoretical Probability Aims and scope Submit manuscript

Abstract

Let {C i} 0 be a sequence of independent and identically distributed random variables with vales in [0, 4]. Let {X n} 0 be a sequence of random variables with values in [0, 1] defined recursively by X n+1=C n+1 X n(1−X n). It is shown here that: (i) E ln C 1<0⇒X n→0 w.p.1. (ii) E ln C 1=0⇒X n→0 in probability (iii) E ln C 1>0, E |ln(4−C 1)|<∞⇒There exists a probability measure π such that π(0, 1)=1 and π is invariant for {X n}. (iv) If there exits an invariant probability measure π such that π{0}=0, then E ln C 1>0 and −∫ ln(1−x) π(dx)=E ln C 1. (v) E ln C 1>0, E |ln(4−C 1)|<∞ and {X n} is Harris irreducible implies that the probability distribution of X n converges in the Cesaro sense to a unique probability distribution on (0, 1) for all X 0≠0.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. Athreya, K. B., and Ney, P. (1978). A new approach to the limit theory of Markov chains. Trans. Am. Math. Soc. 245, 493-501.

    Google Scholar 

  2. Bhattacharya, R. N., and Rao, B. V. (1993). Random Iterations of two quadratic maps. In Cambanis et al. (eds.), Stochastic Processes: A Festschrift in Honor of G. Kalliaanpur, Springer-Verlag.

  3. Bhattacharya, R. N., and Waymire, E. C. (1990). Stochastic Processes with Applications, Wiley, New York.

    Google Scholar 

  4. Dai, J. J. (1999). A Result Regarding Convergence of Random Logistic Maps, Preprint M99-06, Department of Mathematics, Iowa State University.

  5. Devaney, R. L. (1989). An Introduction to Chaotic Dynamical Systems, 2nd Ed., Addison-Wesley, New York.

    Google Scholar 

  6. Durrett, R. (1996). Probability: Theory and Examples, Wadsworth, Pacific Grove, California.

    Google Scholar 

  7. Graczyk, J., and Swiatek, G. (1997). Generic hyperbolicity in the logistic family. Ann. Math. 146, 1-52.

    Google Scholar 

  8. Gyllenberg, M., Hognas, G., and Koski, T. (1994). Population models with environmental stochasticity. J. Math. Biology 32, 93-108.

    Google Scholar 

  9. Klebaner, F. C. (1997). Population and Density Dependent Branching Processes. In Athreya, K. B., and Jagers, P. (eds.), Classical and Modern Branching Processes, Vol. 84, I.M.A., Springer-Verlag.

  10. Kifer, Y. (1988). Random Perturbations of Dynamical Systems, Birkhauser.

  11. May, R. H. (1976). Simple mathematical models with very complicated dynamics. Nature 261, 459-467.

    Google Scholar 

  12. Nummelin, E. (1978). A splitting technique for Harris recurrent Markov chains. Z. Wahsch. Verw. Grebeite 43, 309-318.

    Google Scholar 

  13. Nummelin, E. (1984). General Irreducible Markov Chains and Nonnegative Operators, Cambridge University Press.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Athreya, K.B., Dai, J. Random Logistic Maps. I. Journal of Theoretical Probability 13, 595–608 (2000). https://doi.org/10.1023/A:1007828804691

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1007828804691

Navigation