Martingale-like properties of extreme value process?

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











up vote
1
down vote

favorite
1












Imagine I have a sequence of i.i.d. random variables $x_1,x_2,...,x_n,...$ and let $M_n = max(x_1,...,x_n)$. Is there something I can say about the expectation $mathbbE[M_n | M_n-1]$? What if $x_1,...,x_n$ have a known distribution, such as the exponential distribution or an extreme value distribution?







share|cite|improve this question
























    up vote
    1
    down vote

    favorite
    1












    Imagine I have a sequence of i.i.d. random variables $x_1,x_2,...,x_n,...$ and let $M_n = max(x_1,...,x_n)$. Is there something I can say about the expectation $mathbbE[M_n | M_n-1]$? What if $x_1,...,x_n$ have a known distribution, such as the exponential distribution or an extreme value distribution?







    share|cite|improve this question






















      up vote
      1
      down vote

      favorite
      1









      up vote
      1
      down vote

      favorite
      1






      1





      Imagine I have a sequence of i.i.d. random variables $x_1,x_2,...,x_n,...$ and let $M_n = max(x_1,...,x_n)$. Is there something I can say about the expectation $mathbbE[M_n | M_n-1]$? What if $x_1,...,x_n$ have a known distribution, such as the exponential distribution or an extreme value distribution?







      share|cite|improve this question












      Imagine I have a sequence of i.i.d. random variables $x_1,x_2,...,x_n,...$ and let $M_n = max(x_1,...,x_n)$. Is there something I can say about the expectation $mathbbE[M_n | M_n-1]$? What if $x_1,...,x_n$ have a known distribution, such as the exponential distribution or an extreme value distribution?









      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Aug 15 at 3:45









      Asterix

      1827




      1827




















          2 Answers
          2






          active

          oldest

          votes

















          up vote
          2
          down vote



          accepted










          Since the cumulative maximum will only increase if the next $X_n$ is greater than the current value of the maximum, we have $$E(M_nmid M_n-1) = P(Xle M_n-1)M_n-1 + P(X> M_n-1)E(Xmid X> M_n-1).$$



          In particular, for an exponential with mean $theta$, this works out to $$ (1-e^-M_n-1/theta)M_n-1 + e^-M_n-1/theta(M_n-1+theta)=M_n-1 +theta e^-M_n-1/theta$$ where we used the memorylessness property to get the conditional expectation.






          share|cite|improve this answer



























            up vote
            0
            down vote













            We also know $M_n$ is a sub-martingale since $M_n+1 geq M_n$ almost surely, so
            $$mathbbE[M_n+1|M_1,ldots,M_n] = mathbbE[M_n+1 | M_n] geq M_n.$$






            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: "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%2f2883169%2fmartingale-like-properties-of-extreme-value-process%23new-answer', 'question_page');

              );

              Post as a guest






























              2 Answers
              2






              active

              oldest

              votes








              2 Answers
              2






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes








              up vote
              2
              down vote



              accepted










              Since the cumulative maximum will only increase if the next $X_n$ is greater than the current value of the maximum, we have $$E(M_nmid M_n-1) = P(Xle M_n-1)M_n-1 + P(X> M_n-1)E(Xmid X> M_n-1).$$



              In particular, for an exponential with mean $theta$, this works out to $$ (1-e^-M_n-1/theta)M_n-1 + e^-M_n-1/theta(M_n-1+theta)=M_n-1 +theta e^-M_n-1/theta$$ where we used the memorylessness property to get the conditional expectation.






              share|cite|improve this answer
























                up vote
                2
                down vote



                accepted










                Since the cumulative maximum will only increase if the next $X_n$ is greater than the current value of the maximum, we have $$E(M_nmid M_n-1) = P(Xle M_n-1)M_n-1 + P(X> M_n-1)E(Xmid X> M_n-1).$$



                In particular, for an exponential with mean $theta$, this works out to $$ (1-e^-M_n-1/theta)M_n-1 + e^-M_n-1/theta(M_n-1+theta)=M_n-1 +theta e^-M_n-1/theta$$ where we used the memorylessness property to get the conditional expectation.






                share|cite|improve this answer






















                  up vote
                  2
                  down vote



                  accepted







                  up vote
                  2
                  down vote



                  accepted






                  Since the cumulative maximum will only increase if the next $X_n$ is greater than the current value of the maximum, we have $$E(M_nmid M_n-1) = P(Xle M_n-1)M_n-1 + P(X> M_n-1)E(Xmid X> M_n-1).$$



                  In particular, for an exponential with mean $theta$, this works out to $$ (1-e^-M_n-1/theta)M_n-1 + e^-M_n-1/theta(M_n-1+theta)=M_n-1 +theta e^-M_n-1/theta$$ where we used the memorylessness property to get the conditional expectation.






                  share|cite|improve this answer












                  Since the cumulative maximum will only increase if the next $X_n$ is greater than the current value of the maximum, we have $$E(M_nmid M_n-1) = P(Xle M_n-1)M_n-1 + P(X> M_n-1)E(Xmid X> M_n-1).$$



                  In particular, for an exponential with mean $theta$, this works out to $$ (1-e^-M_n-1/theta)M_n-1 + e^-M_n-1/theta(M_n-1+theta)=M_n-1 +theta e^-M_n-1/theta$$ where we used the memorylessness property to get the conditional expectation.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Aug 15 at 3:56









                  spaceisdarkgreen

                  28k21548




                  28k21548




















                      up vote
                      0
                      down vote













                      We also know $M_n$ is a sub-martingale since $M_n+1 geq M_n$ almost surely, so
                      $$mathbbE[M_n+1|M_1,ldots,M_n] = mathbbE[M_n+1 | M_n] geq M_n.$$






                      share|cite|improve this answer
























                        up vote
                        0
                        down vote













                        We also know $M_n$ is a sub-martingale since $M_n+1 geq M_n$ almost surely, so
                        $$mathbbE[M_n+1|M_1,ldots,M_n] = mathbbE[M_n+1 | M_n] geq M_n.$$






                        share|cite|improve this answer






















                          up vote
                          0
                          down vote










                          up vote
                          0
                          down vote









                          We also know $M_n$ is a sub-martingale since $M_n+1 geq M_n$ almost surely, so
                          $$mathbbE[M_n+1|M_1,ldots,M_n] = mathbbE[M_n+1 | M_n] geq M_n.$$






                          share|cite|improve this answer












                          We also know $M_n$ is a sub-martingale since $M_n+1 geq M_n$ almost surely, so
                          $$mathbbE[M_n+1|M_1,ldots,M_n] = mathbbE[M_n+1 | M_n] geq M_n.$$







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered Aug 15 at 4:29









                          cdipaolo

                          677311




                          677311






















                               

                              draft saved


                              draft discarded


























                               


                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function ()
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2883169%2fmartingale-like-properties-of-extreme-value-process%23new-answer', 'question_page');

                              );

                              Post as a guest













































































                              這個網誌中的熱門文章

                              tkz-euclide: tkzDrawCircle[R] not working

                              How to combine Bézier curves to a surface?

                              1st Magritte Awards