Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
  1. Home
  2. Probability Theory and Related Fields
  3. Article
Regeneration for chains with infinite memory
Download PDF
Download PDF
  • Published: December 1993

Regeneration for chains with infinite memory

  • P. Ney1 &
  • E. Nummelin2 

Probability Theory and Related Fields volume 96, pages 503–520 (1993)Cite this article

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Summary

A regeneration structure is established for chains with infinite memory. The memory is required to decay only along a single recurrent path. When there are many recurrent paths (e.g. under conservativity) the construction yields a decomposition into regenerative recurrent classes.

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

References

  • [A-Ne] Athreya, K., Ney, P.: A new approach to the limit theory of recurrent Markov chains. Trans. Am. Math. Soc.245, 493–501 (1978)

    Google Scholar 

  • [B] Berbee, H.: Chains with infinite connections: uniqueness and Markov representations. Probab. Theory Relat. Fields76, 243–253 (1987)

    Google Scholar 

  • [B-K] Bramson, M., Kalikow, S.: Nonuniqueness ing-functions. University of Wisconsin Technical Report (1992)

  • [D] Doeblin, W.: Sur deux problèmes de M. Kolmogoroff concernant les chaines dénombrables. Bull. Soc. Math. Fr.66, 210–220 (1938).

    Google Scholar 

  • [D-F] Doeblin, W., Fortet, E.: Sur les chaines à liaisons complétes. Bull. Soc. Math. Fr.65, 132–148 (1937)

    Google Scholar 

  • [I-G] Iosifescu, M., Grigorescu, S.: Dependence with complete connectins and applications. Cambridge: Cambridge University Press 1990

    Google Scholar 

  • Kalpazidou, S.: A Gaussian measure for certain continued fractions. Proc. Am. Math. Soc.96, 629–635 (1986)

    Google Scholar 

  • [L] Lalley, S.P.: Regenerative representation for one dimensional Gibbs states. Ann. Probab.14, 1262–1271 (1986)

    Google Scholar 

  • [N] Norman, M.F.: Markov processes and learning models. New York: Academic Press 1972

    Google Scholar 

  • [N-Nu] Ney, P., Nummelin, E.: Regeneration for chains of infinite order and random maps. In: Proceedings of conference in honor of Doeblin. Blaubeuern 1991

  • [Nu1] Nummelin, E.: A splitting technique for Harris recurrent Markov chains. Z. Wahrscheinlichkeitstheor. Verw. Geb.43, 309–318 (1978)

    Google Scholar 

  • [Nu2] Nummelin, E.: Renewal representations for Markov operators. Adv. Math.90, 15–46 (1991)

    Google Scholar 

  • [O] Orey, S.: Lecture notes on limit theorems for Markov chain transition probabilities. London: Van Nostrand, Reinhold 1971

    Google Scholar 

  • [R] Rosenblatt, M.: Markov processes. Structures and asymptotic behaviour. Berlin Heidelberg New York: Springer 1971

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Wisconsin, Van Vleck Hall, 480 Lincoln Drive, 53706, Madison, WI, USA

    P. Ney

  2. Department of Mathematics, University of Helsinki, Hallituskatu 15, SF-00014, Helsinki, Finland

    E. Nummelin

Authors
  1. P. Ney
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Nummelin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by NSF Grant DMS 89-01464

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Ney, P., Nummelin, E. Regeneration for chains with infinite memory. Probab. Th. Rel. Fields 96, 503–520 (1993). https://doi.org/10.1007/BF01200207

Download citation

  • Received: 03 December 1990

  • Revised: 06 April 1993

  • Issue Date: December 1993

  • DOI: https://doi.org/10.1007/BF01200207

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Mathematics subject classification (1980)

  • 60K05
  • 60J05
Download PDF

Working on a manuscript?

Avoid the common mistakes

Advertisement

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature