1
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      The existence of moments for stationary Markov chains

      Journal of Applied Probability
      JSTOR

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          We give conditions under which the stationary distribution π of a Markov chain admits moments of the general form ∫ f( x) π( dx), where f is a general function; specific examples include f( x) = x r and f( x) = e sx . In general the time-dependent moments of the chain then converge to the stationary moments. We show that in special cases this convergence of moments occurs at a geometric rate. The results are applied to random walk on [0, ∞).

          Related collections

          Most cited references5

          • Record: found
          • Abstract: not found
          • Article: not found

          A splitting technique for Harris recurrent Markov chains

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Geometric ergodicity of Harris recurrent Marcov chains with applications to renewal theory

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Criteria for classifying general Markov chains

              The aim of this paper is to present a comprehensive set of criteria for classifying as recurrent, transient, null or positive the sets visited by a general state space Markov chain. When the chain is irreducible in some sense, these then provide criteria for classifying the chain itself, provided the sets considered actually reflect the status of the chain as a whole. The first part of the paper is concerned with the connections between various definitions of recurrence, transience, nullity and positivity for sets and for irreducible chains; here we also elaborate the idea of status sets for irreducible chains. In the second part we give our criteria for classifying sets. When the state space is countable, our results for recurrence, transience and positivity reduce to the classical work of Foster (1953); for continuous-valued chains they extend results of Lamperti (1960), (1963); for general spaces the positivity and recurrence criteria strengthen those of Tweedie (1975b).
                Bookmark

                Author and article information

                Journal
                applab
                Journal of Applied Probability
                J. Appl. Probab.
                JSTOR
                0021-9002
                1475-6072
                March 1983
                July 14 2016
                : 20
                : 01
                : 191-196
                Article
                10.2307/3213735
                d37a9826-e1e6-4da0-bdc5-3e3fcd37775c
                © 2016
                History

                Comments

                Comment on this article