Matching correlations Discrete Time Markov Chain

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite












Question



Suppose we have some $n$ dimensional Discrete Time Markov Chain, which is characterized by an $ntimes n$ matrix $A$ and state space $S=1,dots,n$ we denote $(X_n)_n=1^infty$ for the associated discrete time process. Suppose we have given $m < n$ lag-correlations $ell_1,dots,ell_m$ which we want to match, i.e. we want to have $operatornameCorr(X_n, X_n+k)=ell_k$ for all $k=1,dots,m$. Is there an efficient/intuitive method for doing this?







share|cite|improve this question

























    up vote
    1
    down vote

    favorite












    Question



    Suppose we have some $n$ dimensional Discrete Time Markov Chain, which is characterized by an $ntimes n$ matrix $A$ and state space $S=1,dots,n$ we denote $(X_n)_n=1^infty$ for the associated discrete time process. Suppose we have given $m < n$ lag-correlations $ell_1,dots,ell_m$ which we want to match, i.e. we want to have $operatornameCorr(X_n, X_n+k)=ell_k$ for all $k=1,dots,m$. Is there an efficient/intuitive method for doing this?







    share|cite|improve this question























      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      Question



      Suppose we have some $n$ dimensional Discrete Time Markov Chain, which is characterized by an $ntimes n$ matrix $A$ and state space $S=1,dots,n$ we denote $(X_n)_n=1^infty$ for the associated discrete time process. Suppose we have given $m < n$ lag-correlations $ell_1,dots,ell_m$ which we want to match, i.e. we want to have $operatornameCorr(X_n, X_n+k)=ell_k$ for all $k=1,dots,m$. Is there an efficient/intuitive method for doing this?







      share|cite|improve this question













      Question



      Suppose we have some $n$ dimensional Discrete Time Markov Chain, which is characterized by an $ntimes n$ matrix $A$ and state space $S=1,dots,n$ we denote $(X_n)_n=1^infty$ for the associated discrete time process. Suppose we have given $m < n$ lag-correlations $ell_1,dots,ell_m$ which we want to match, i.e. we want to have $operatornameCorr(X_n, X_n+k)=ell_k$ for all $k=1,dots,m$. Is there an efficient/intuitive method for doing this?









      share|cite|improve this question












      share|cite|improve this question




      share|cite|improve this question








      edited Jul 31 at 9:18
























      asked Jul 31 at 7:50









      Darkwizie

      1208




      1208

























          active

          oldest

          votes











          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: "69"
          ;
          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',
          convertImagesToLinks: true,
          noModals: false,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          noCode: true, onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );








           

          draft saved


          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2867772%2fmatching-correlations-discrete-time-markov-chain%23new-answer', 'question_page');

          );

          Post as a guest



































          active

          oldest

          votes













          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes










           

          draft saved


          draft discarded


























           


          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2867772%2fmatching-correlations-discrete-time-markov-chain%23new-answer', 'question_page');

          );

          Post as a guest













































































          Comments

          Popular posts from this blog

          What is the equation of a 3D cone with generalised tilt?

          Color the edges and diagonals of a regular polygon

          Relationship between determinant of matrix and determinant of adjoint?