IDEAS home Printed from https://ideas.repec.org/a/spr/joecth/v23y2003i1p85-105.html
   My bibliography  Save this article

Random continued fractions: a Markov chain approach

Author

Listed:
  • Alok Goswami

Abstract

By allowing the numbers appearing in a continued fraction to be random, one gets what are called random continued fractions. Under fairly general conditions, including the case when the random variables are i.i.d. non-negative, random continued fractions converge with probability one. A markovian algorithm seems to play a crucial role in studying the distribution of random continued fractions. This Markov Chain on $S=(0,\infty )$ is generated by iteration of random monotone decreasing maps on S and the connection comes from the fact that the distribution of random continued fraction is obtained as an invariant probability of the Markov Chain. Using the splitting condition, it is shown that the distribution of the Markov Chain converges exponentially fast in the Kolmogorov distance to an unique invariant probability $\pi$ , which is shown to be non-atomic, except in the degenerate case. A sufficient condition is given for the invariant probability $\pi$ to have full support S. In some special cases, the invaraint probability is obtained explicitly and this includes one case when the probability $\pi$ turns out to be a singular non-atomic probability with full support S. Extensions of some results to higher dimensions are also discussed. Copyright Springer-Verlag Berlin/Heidelberg 2003

Suggested Citation

  • Alok Goswami, 2003. "Random continued fractions: a Markov chain approach," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 23(1), pages 85-105, December.
    • Handle: RePEc:spr:joecth:v:23:y:2003:i:1:p:85-105
    DOI: 10.1007/s00199-002-0333-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00199-002-0333-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00199-002-0333-4?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.

    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:spr:joecth:v:23:y:2003:i:1:p:85-105. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.