Are all transient states positive recurrent?












1














In my Stochastic process lecture notes, I noticed that in problems related to a finite Markov chain, the mean recurrence time are calculated only for recurrent states. I calculated the mean recurrence time of all transient states and found them to be positive recurrent.



Is mean recurrence time calculated only for recurrent states? And is it true that all transient states are positive recurrent?










share|cite|improve this question



























    1














    In my Stochastic process lecture notes, I noticed that in problems related to a finite Markov chain, the mean recurrence time are calculated only for recurrent states. I calculated the mean recurrence time of all transient states and found them to be positive recurrent.



    Is mean recurrence time calculated only for recurrent states? And is it true that all transient states are positive recurrent?










    share|cite|improve this question

























      1












      1








      1


      1





      In my Stochastic process lecture notes, I noticed that in problems related to a finite Markov chain, the mean recurrence time are calculated only for recurrent states. I calculated the mean recurrence time of all transient states and found them to be positive recurrent.



      Is mean recurrence time calculated only for recurrent states? And is it true that all transient states are positive recurrent?










      share|cite|improve this question













      In my Stochastic process lecture notes, I noticed that in problems related to a finite Markov chain, the mean recurrence time are calculated only for recurrent states. I calculated the mean recurrence time of all transient states and found them to be positive recurrent.



      Is mean recurrence time calculated only for recurrent states? And is it true that all transient states are positive recurrent?







      stochastic-processes






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked 3 hours ago









      user46697

      345212




      345212






















          2 Answers
          2






          active

          oldest

          votes


















          2














          Transient states are those which may never be visited again. Positive recurrent states will always be revisited within some (expected) finite time. Therefore, no transient state is positive recurrent.






          share|cite|improve this answer





























            1














            To quote from Meyn & Tweedie's Markov Chains & Stochastic Stability, on page 175, a state $alpha$ is recurrent for a Markov chain $(Phi_t)_t$ if $mathbb{E_alpha}[eta_alpha]=infty$ (infinite expected number of visits) and transient if $mathbb{E_alpha}[eta_alpha]<infty$ (finite expected number of visits), when$$eta_alpha=sum_{t=1}^infty mathbb{I}_alpha(Phi_t)$$is the number of visits. This definition does not involve nullity or positivity. To further quote from Meyn & Tweedie's Markov Chains & Stochastic Stability, on page 453, a state $alpha$ is null if$$lim_{t to infty} P^t(alpha,alpha) = 0$$and positive if$$limsup_{t to infty} P^t(alpha,alpha) > 0$$If a state $alpha$ is transient then it is necessary null, while if a state $alpha$ is positive, it is necessary recurrent. An important result (see Theorems 10.0.1 & 10.4.9 in Meyn & Tweedie's Markov Chains & Stochastic Stability) is that an irreducible recurrent Markov chain $(Phi_t)_t$ admits a unique (up to multiplicative constants) invariant measure. When the measure is finite the chain is necessarily positive recurrent, while in the opposite case, it is null recurrent.






            share|cite|improve this answer























              Your Answer





              StackExchange.ifUsing("editor", function () {
              return StackExchange.using("mathjaxEditing", function () {
              StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
              StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
              });
              });
              }, "mathjax-editing");

              StackExchange.ready(function() {
              var channelOptions = {
              tags: "".split(" "),
              id: "65"
              };
              initTagRenderer("".split(" "), "".split(" "), channelOptions);

              StackExchange.using("externalEditor", function() {
              // Have to fire editor after snippets, if snippets enabled
              if (StackExchange.settings.snippets.snippetsEnabled) {
              StackExchange.using("snippets", function() {
              createEditor();
              });
              }
              else {
              createEditor();
              }
              });

              function createEditor() {
              StackExchange.prepareEditor({
              heartbeatType: 'answer',
              autoActivateHeartbeat: false,
              convertImagesToLinks: false,
              noModals: true,
              showLowRepImageUploadWarning: true,
              reputationToPostImages: null,
              bindNavPrevention: true,
              postfix: "",
              imageUploader: {
              brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
              contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
              allowUrls: true
              },
              onDemand: true,
              discardSelector: ".discard-answer"
              ,immediatelyShowMarkdownHelp:true
              });


              }
              });














              draft saved

              draft discarded


















              StackExchange.ready(
              function () {
              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstats.stackexchange.com%2fquestions%2f385407%2fare-all-transient-states-positive-recurrent%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              2 Answers
              2






              active

              oldest

              votes








              2 Answers
              2






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              2














              Transient states are those which may never be visited again. Positive recurrent states will always be revisited within some (expected) finite time. Therefore, no transient state is positive recurrent.






              share|cite|improve this answer


























                2














                Transient states are those which may never be visited again. Positive recurrent states will always be revisited within some (expected) finite time. Therefore, no transient state is positive recurrent.






                share|cite|improve this answer
























                  2












                  2








                  2






                  Transient states are those which may never be visited again. Positive recurrent states will always be revisited within some (expected) finite time. Therefore, no transient state is positive recurrent.






                  share|cite|improve this answer












                  Transient states are those which may never be visited again. Positive recurrent states will always be revisited within some (expected) finite time. Therefore, no transient state is positive recurrent.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered 3 hours ago









                  conjectures

                  3,1831530




                  3,1831530

























                      1














                      To quote from Meyn & Tweedie's Markov Chains & Stochastic Stability, on page 175, a state $alpha$ is recurrent for a Markov chain $(Phi_t)_t$ if $mathbb{E_alpha}[eta_alpha]=infty$ (infinite expected number of visits) and transient if $mathbb{E_alpha}[eta_alpha]<infty$ (finite expected number of visits), when$$eta_alpha=sum_{t=1}^infty mathbb{I}_alpha(Phi_t)$$is the number of visits. This definition does not involve nullity or positivity. To further quote from Meyn & Tweedie's Markov Chains & Stochastic Stability, on page 453, a state $alpha$ is null if$$lim_{t to infty} P^t(alpha,alpha) = 0$$and positive if$$limsup_{t to infty} P^t(alpha,alpha) > 0$$If a state $alpha$ is transient then it is necessary null, while if a state $alpha$ is positive, it is necessary recurrent. An important result (see Theorems 10.0.1 & 10.4.9 in Meyn & Tweedie's Markov Chains & Stochastic Stability) is that an irreducible recurrent Markov chain $(Phi_t)_t$ admits a unique (up to multiplicative constants) invariant measure. When the measure is finite the chain is necessarily positive recurrent, while in the opposite case, it is null recurrent.






                      share|cite|improve this answer




























                        1














                        To quote from Meyn & Tweedie's Markov Chains & Stochastic Stability, on page 175, a state $alpha$ is recurrent for a Markov chain $(Phi_t)_t$ if $mathbb{E_alpha}[eta_alpha]=infty$ (infinite expected number of visits) and transient if $mathbb{E_alpha}[eta_alpha]<infty$ (finite expected number of visits), when$$eta_alpha=sum_{t=1}^infty mathbb{I}_alpha(Phi_t)$$is the number of visits. This definition does not involve nullity or positivity. To further quote from Meyn & Tweedie's Markov Chains & Stochastic Stability, on page 453, a state $alpha$ is null if$$lim_{t to infty} P^t(alpha,alpha) = 0$$and positive if$$limsup_{t to infty} P^t(alpha,alpha) > 0$$If a state $alpha$ is transient then it is necessary null, while if a state $alpha$ is positive, it is necessary recurrent. An important result (see Theorems 10.0.1 & 10.4.9 in Meyn & Tweedie's Markov Chains & Stochastic Stability) is that an irreducible recurrent Markov chain $(Phi_t)_t$ admits a unique (up to multiplicative constants) invariant measure. When the measure is finite the chain is necessarily positive recurrent, while in the opposite case, it is null recurrent.






                        share|cite|improve this answer


























                          1












                          1








                          1






                          To quote from Meyn & Tweedie's Markov Chains & Stochastic Stability, on page 175, a state $alpha$ is recurrent for a Markov chain $(Phi_t)_t$ if $mathbb{E_alpha}[eta_alpha]=infty$ (infinite expected number of visits) and transient if $mathbb{E_alpha}[eta_alpha]<infty$ (finite expected number of visits), when$$eta_alpha=sum_{t=1}^infty mathbb{I}_alpha(Phi_t)$$is the number of visits. This definition does not involve nullity or positivity. To further quote from Meyn & Tweedie's Markov Chains & Stochastic Stability, on page 453, a state $alpha$ is null if$$lim_{t to infty} P^t(alpha,alpha) = 0$$and positive if$$limsup_{t to infty} P^t(alpha,alpha) > 0$$If a state $alpha$ is transient then it is necessary null, while if a state $alpha$ is positive, it is necessary recurrent. An important result (see Theorems 10.0.1 & 10.4.9 in Meyn & Tweedie's Markov Chains & Stochastic Stability) is that an irreducible recurrent Markov chain $(Phi_t)_t$ admits a unique (up to multiplicative constants) invariant measure. When the measure is finite the chain is necessarily positive recurrent, while in the opposite case, it is null recurrent.






                          share|cite|improve this answer














                          To quote from Meyn & Tweedie's Markov Chains & Stochastic Stability, on page 175, a state $alpha$ is recurrent for a Markov chain $(Phi_t)_t$ if $mathbb{E_alpha}[eta_alpha]=infty$ (infinite expected number of visits) and transient if $mathbb{E_alpha}[eta_alpha]<infty$ (finite expected number of visits), when$$eta_alpha=sum_{t=1}^infty mathbb{I}_alpha(Phi_t)$$is the number of visits. This definition does not involve nullity or positivity. To further quote from Meyn & Tweedie's Markov Chains & Stochastic Stability, on page 453, a state $alpha$ is null if$$lim_{t to infty} P^t(alpha,alpha) = 0$$and positive if$$limsup_{t to infty} P^t(alpha,alpha) > 0$$If a state $alpha$ is transient then it is necessary null, while if a state $alpha$ is positive, it is necessary recurrent. An important result (see Theorems 10.0.1 & 10.4.9 in Meyn & Tweedie's Markov Chains & Stochastic Stability) is that an irreducible recurrent Markov chain $(Phi_t)_t$ admits a unique (up to multiplicative constants) invariant measure. When the measure is finite the chain is necessarily positive recurrent, while in the opposite case, it is null recurrent.







                          share|cite|improve this answer














                          share|cite|improve this answer



                          share|cite|improve this answer








                          edited 2 hours ago

























                          answered 2 hours ago









                          Xi'an

                          53.3k689345




                          53.3k689345






























                              draft saved

                              draft discarded




















































                              Thanks for contributing an answer to Cross Validated!


                              • Please be sure to answer the question. Provide details and share your research!

                              But avoid



                              • Asking for help, clarification, or responding to other answers.

                              • Making statements based on opinion; back them up with references or personal experience.


                              Use MathJax to format equations. MathJax reference.


                              To learn more, see our tips on writing great answers.





                              Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                              Please pay close attention to the following guidance:


                              • Please be sure to answer the question. Provide details and share your research!

                              But avoid



                              • Asking for help, clarification, or responding to other answers.

                              • Making statements based on opinion; back them up with references or personal experience.


                              To learn more, see our tips on writing great answers.




                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function () {
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstats.stackexchange.com%2fquestions%2f385407%2fare-all-transient-states-positive-recurrent%23new-answer', 'question_page');
                              }
                              );

                              Post as a guest















                              Required, but never shown





















































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown

































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown







                              Popular posts from this blog

                              Understanding the information contained in the Deep Space Network XML data?

                              Ross-on-Wye

                              Eastern Orthodox Church