Martingale-like properties of extreme value process?

Clash Royale CLAN TAG#URR8PPP
up vote
1
down vote
favorite
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?
probability probability-distributions random-variables
add a comment |Â
up vote
1
down vote
favorite
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?
probability probability-distributions random-variables
add a comment |Â
up vote
1
down vote
favorite
up vote
1
down vote
favorite
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?
probability probability-distributions random-variables
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?
probability probability-distributions random-variables
asked Aug 15 at 3:45
Asterix
1827
1827
add a comment |Â
add a comment |Â
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.
add a comment |Â
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.$$
add a comment |Â
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.
add a comment |Â
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.
add a comment |Â
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.
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.
answered Aug 15 at 3:56
spaceisdarkgreen
28k21548
28k21548
add a comment |Â
add a comment |Â
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.$$
add a comment |Â
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.$$
add a comment |Â
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.$$
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.$$
answered Aug 15 at 4:29
cdipaolo
677311
677311
add a comment |Â
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
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
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password