Random Walk Threshold Problem with a Time-Dependent Threshold
Clash Royale CLAN TAG#URR8PPP
up vote
3
down vote
favorite
For any constant threshold in a random walk, the probability we cross the threshold at some time goes to 1 as time goes to infinity. But how can we approach the problem if the threshold is time dependent, say as a linear function? To formalize:
Let $S_t = X_1 + X_2 ... + X_t$ represent a random walk, with each iid $X_i$ being either -1 or 1 with equal probability. Let $0 le theta le 1$. What's the probability that at some time $t > 0$ during the random walk, $S_t ge theta t $?
probability markov-chains
add a comment |Â
up vote
3
down vote
favorite
For any constant threshold in a random walk, the probability we cross the threshold at some time goes to 1 as time goes to infinity. But how can we approach the problem if the threshold is time dependent, say as a linear function? To formalize:
Let $S_t = X_1 + X_2 ... + X_t$ represent a random walk, with each iid $X_i$ being either -1 or 1 with equal probability. Let $0 le theta le 1$. What's the probability that at some time $t > 0$ during the random walk, $S_t ge theta t $?
probability markov-chains
add a comment |Â
up vote
3
down vote
favorite
up vote
3
down vote
favorite
For any constant threshold in a random walk, the probability we cross the threshold at some time goes to 1 as time goes to infinity. But how can we approach the problem if the threshold is time dependent, say as a linear function? To formalize:
Let $S_t = X_1 + X_2 ... + X_t$ represent a random walk, with each iid $X_i$ being either -1 or 1 with equal probability. Let $0 le theta le 1$. What's the probability that at some time $t > 0$ during the random walk, $S_t ge theta t $?
probability markov-chains
For any constant threshold in a random walk, the probability we cross the threshold at some time goes to 1 as time goes to infinity. But how can we approach the problem if the threshold is time dependent, say as a linear function? To formalize:
Let $S_t = X_1 + X_2 ... + X_t$ represent a random walk, with each iid $X_i$ being either -1 or 1 with equal probability. Let $0 le theta le 1$. What's the probability that at some time $t > 0$ during the random walk, $S_t ge theta t $?
probability markov-chains
edited Jul 11 '15 at 5:22
asked Jul 11 '15 at 3:18
Alex Rose
163
163
add a comment |Â
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
2
down vote
It can be shown that for $theta>0$, $mathsfP(S_ngetheta n text for some n>0)<1$.
Let $Z_n=S_n/n$ where $S_n$ is a simple symmetric random walk. $Z_n$ is an $(mathcalF_n^X)$ backward martingale ($mathsfE[X_1|mathcalF_n^X]=Z_n$). Fix $hat Z_n=Z_N-n$ and $hat mathcalF_n=mathcalF_N-n^X$ ($0le n<N$) so that $hat Z_n$ is a zero-mean martingale. Then
$$mathsfPleft(max_1le nle NZ_ngethetaright)=mathsfPleft(max_0le n< Nhat Z_ngethetaright)le fracmathsfEhat Z_N-1^2mathsfEhat Z_N-1^2+theta^2=fracmathsfEX_1^2mathsfEX_1^2+theta^2=frac11+theta^2<1$$
where the first inequality is of the Cantelli type or from more directly this and this propositions proved with Cantelli's method in combination with Doob's martingale inequality . We then let $Nrightarrow infty$.
On the other hand, for $thetale 1$, $mathsfP(S_ngetheta n text for some n>0)gefrac12$. So, for $theta=1$ this probability is exactly $frac12$.
How did you get $Pmax_0le n< Nhat Z_ngetheta le fracmathbbEhat Z_N-1^2mathbbEhat Z_N-1^2+theta^2$?
â Hans
Jul 15 at 20:11
@Hans It was long time ago... However, I'm sure that this follows from a version of the Kolmogorov maximal inequality adapted to martingales.
â d.k.o.
Jul 15 at 21:39
Kolmogorov maximal inequality is of the Chebyshev type, which will readily give you $theta^2$ on the denominator. My concern is with that extra $mathsfEhat Z_N-1^2$ on the denominator. Where does it come from?
â Hans
Jul 15 at 23:29
@Hans Look at this question or its older version.
â d.k.o.
Jul 16 at 1:39
1
Yes. I was about to write about Cantelli's inequality en.wikipedia.org/wiki/Cantelli%27s_inequality which is what your links are about. Thank you.
â Hans
Jul 16 at 5:44
 |Â
show 1 more comment
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
2
down vote
It can be shown that for $theta>0$, $mathsfP(S_ngetheta n text for some n>0)<1$.
Let $Z_n=S_n/n$ where $S_n$ is a simple symmetric random walk. $Z_n$ is an $(mathcalF_n^X)$ backward martingale ($mathsfE[X_1|mathcalF_n^X]=Z_n$). Fix $hat Z_n=Z_N-n$ and $hat mathcalF_n=mathcalF_N-n^X$ ($0le n<N$) so that $hat Z_n$ is a zero-mean martingale. Then
$$mathsfPleft(max_1le nle NZ_ngethetaright)=mathsfPleft(max_0le n< Nhat Z_ngethetaright)le fracmathsfEhat Z_N-1^2mathsfEhat Z_N-1^2+theta^2=fracmathsfEX_1^2mathsfEX_1^2+theta^2=frac11+theta^2<1$$
where the first inequality is of the Cantelli type or from more directly this and this propositions proved with Cantelli's method in combination with Doob's martingale inequality . We then let $Nrightarrow infty$.
On the other hand, for $thetale 1$, $mathsfP(S_ngetheta n text for some n>0)gefrac12$. So, for $theta=1$ this probability is exactly $frac12$.
How did you get $Pmax_0le n< Nhat Z_ngetheta le fracmathbbEhat Z_N-1^2mathbbEhat Z_N-1^2+theta^2$?
â Hans
Jul 15 at 20:11
@Hans It was long time ago... However, I'm sure that this follows from a version of the Kolmogorov maximal inequality adapted to martingales.
â d.k.o.
Jul 15 at 21:39
Kolmogorov maximal inequality is of the Chebyshev type, which will readily give you $theta^2$ on the denominator. My concern is with that extra $mathsfEhat Z_N-1^2$ on the denominator. Where does it come from?
â Hans
Jul 15 at 23:29
@Hans Look at this question or its older version.
â d.k.o.
Jul 16 at 1:39
1
Yes. I was about to write about Cantelli's inequality en.wikipedia.org/wiki/Cantelli%27s_inequality which is what your links are about. Thank you.
â Hans
Jul 16 at 5:44
 |Â
show 1 more comment
up vote
2
down vote
It can be shown that for $theta>0$, $mathsfP(S_ngetheta n text for some n>0)<1$.
Let $Z_n=S_n/n$ where $S_n$ is a simple symmetric random walk. $Z_n$ is an $(mathcalF_n^X)$ backward martingale ($mathsfE[X_1|mathcalF_n^X]=Z_n$). Fix $hat Z_n=Z_N-n$ and $hat mathcalF_n=mathcalF_N-n^X$ ($0le n<N$) so that $hat Z_n$ is a zero-mean martingale. Then
$$mathsfPleft(max_1le nle NZ_ngethetaright)=mathsfPleft(max_0le n< Nhat Z_ngethetaright)le fracmathsfEhat Z_N-1^2mathsfEhat Z_N-1^2+theta^2=fracmathsfEX_1^2mathsfEX_1^2+theta^2=frac11+theta^2<1$$
where the first inequality is of the Cantelli type or from more directly this and this propositions proved with Cantelli's method in combination with Doob's martingale inequality . We then let $Nrightarrow infty$.
On the other hand, for $thetale 1$, $mathsfP(S_ngetheta n text for some n>0)gefrac12$. So, for $theta=1$ this probability is exactly $frac12$.
How did you get $Pmax_0le n< Nhat Z_ngetheta le fracmathbbEhat Z_N-1^2mathbbEhat Z_N-1^2+theta^2$?
â Hans
Jul 15 at 20:11
@Hans It was long time ago... However, I'm sure that this follows from a version of the Kolmogorov maximal inequality adapted to martingales.
â d.k.o.
Jul 15 at 21:39
Kolmogorov maximal inequality is of the Chebyshev type, which will readily give you $theta^2$ on the denominator. My concern is with that extra $mathsfEhat Z_N-1^2$ on the denominator. Where does it come from?
â Hans
Jul 15 at 23:29
@Hans Look at this question or its older version.
â d.k.o.
Jul 16 at 1:39
1
Yes. I was about to write about Cantelli's inequality en.wikipedia.org/wiki/Cantelli%27s_inequality which is what your links are about. Thank you.
â Hans
Jul 16 at 5:44
 |Â
show 1 more comment
up vote
2
down vote
up vote
2
down vote
It can be shown that for $theta>0$, $mathsfP(S_ngetheta n text for some n>0)<1$.
Let $Z_n=S_n/n$ where $S_n$ is a simple symmetric random walk. $Z_n$ is an $(mathcalF_n^X)$ backward martingale ($mathsfE[X_1|mathcalF_n^X]=Z_n$). Fix $hat Z_n=Z_N-n$ and $hat mathcalF_n=mathcalF_N-n^X$ ($0le n<N$) so that $hat Z_n$ is a zero-mean martingale. Then
$$mathsfPleft(max_1le nle NZ_ngethetaright)=mathsfPleft(max_0le n< Nhat Z_ngethetaright)le fracmathsfEhat Z_N-1^2mathsfEhat Z_N-1^2+theta^2=fracmathsfEX_1^2mathsfEX_1^2+theta^2=frac11+theta^2<1$$
where the first inequality is of the Cantelli type or from more directly this and this propositions proved with Cantelli's method in combination with Doob's martingale inequality . We then let $Nrightarrow infty$.
On the other hand, for $thetale 1$, $mathsfP(S_ngetheta n text for some n>0)gefrac12$. So, for $theta=1$ this probability is exactly $frac12$.
It can be shown that for $theta>0$, $mathsfP(S_ngetheta n text for some n>0)<1$.
Let $Z_n=S_n/n$ where $S_n$ is a simple symmetric random walk. $Z_n$ is an $(mathcalF_n^X)$ backward martingale ($mathsfE[X_1|mathcalF_n^X]=Z_n$). Fix $hat Z_n=Z_N-n$ and $hat mathcalF_n=mathcalF_N-n^X$ ($0le n<N$) so that $hat Z_n$ is a zero-mean martingale. Then
$$mathsfPleft(max_1le nle NZ_ngethetaright)=mathsfPleft(max_0le n< Nhat Z_ngethetaright)le fracmathsfEhat Z_N-1^2mathsfEhat Z_N-1^2+theta^2=fracmathsfEX_1^2mathsfEX_1^2+theta^2=frac11+theta^2<1$$
where the first inequality is of the Cantelli type or from more directly this and this propositions proved with Cantelli's method in combination with Doob's martingale inequality . We then let $Nrightarrow infty$.
On the other hand, for $thetale 1$, $mathsfP(S_ngetheta n text for some n>0)gefrac12$. So, for $theta=1$ this probability is exactly $frac12$.
edited Aug 9 at 17:09
Hans
4,17721028
4,17721028
answered Jul 11 '15 at 5:27
d.k.o.
7,709526
7,709526
How did you get $Pmax_0le n< Nhat Z_ngetheta le fracmathbbEhat Z_N-1^2mathbbEhat Z_N-1^2+theta^2$?
â Hans
Jul 15 at 20:11
@Hans It was long time ago... However, I'm sure that this follows from a version of the Kolmogorov maximal inequality adapted to martingales.
â d.k.o.
Jul 15 at 21:39
Kolmogorov maximal inequality is of the Chebyshev type, which will readily give you $theta^2$ on the denominator. My concern is with that extra $mathsfEhat Z_N-1^2$ on the denominator. Where does it come from?
â Hans
Jul 15 at 23:29
@Hans Look at this question or its older version.
â d.k.o.
Jul 16 at 1:39
1
Yes. I was about to write about Cantelli's inequality en.wikipedia.org/wiki/Cantelli%27s_inequality which is what your links are about. Thank you.
â Hans
Jul 16 at 5:44
 |Â
show 1 more comment
How did you get $Pmax_0le n< Nhat Z_ngetheta le fracmathbbEhat Z_N-1^2mathbbEhat Z_N-1^2+theta^2$?
â Hans
Jul 15 at 20:11
@Hans It was long time ago... However, I'm sure that this follows from a version of the Kolmogorov maximal inequality adapted to martingales.
â d.k.o.
Jul 15 at 21:39
Kolmogorov maximal inequality is of the Chebyshev type, which will readily give you $theta^2$ on the denominator. My concern is with that extra $mathsfEhat Z_N-1^2$ on the denominator. Where does it come from?
â Hans
Jul 15 at 23:29
@Hans Look at this question or its older version.
â d.k.o.
Jul 16 at 1:39
1
Yes. I was about to write about Cantelli's inequality en.wikipedia.org/wiki/Cantelli%27s_inequality which is what your links are about. Thank you.
â Hans
Jul 16 at 5:44
How did you get $Pmax_0le n< Nhat Z_ngetheta le fracmathbbEhat Z_N-1^2mathbbEhat Z_N-1^2+theta^2$?
â Hans
Jul 15 at 20:11
How did you get $Pmax_0le n< Nhat Z_ngetheta le fracmathbbEhat Z_N-1^2mathbbEhat Z_N-1^2+theta^2$?
â Hans
Jul 15 at 20:11
@Hans It was long time ago... However, I'm sure that this follows from a version of the Kolmogorov maximal inequality adapted to martingales.
â d.k.o.
Jul 15 at 21:39
@Hans It was long time ago... However, I'm sure that this follows from a version of the Kolmogorov maximal inequality adapted to martingales.
â d.k.o.
Jul 15 at 21:39
Kolmogorov maximal inequality is of the Chebyshev type, which will readily give you $theta^2$ on the denominator. My concern is with that extra $mathsfEhat Z_N-1^2$ on the denominator. Where does it come from?
â Hans
Jul 15 at 23:29
Kolmogorov maximal inequality is of the Chebyshev type, which will readily give you $theta^2$ on the denominator. My concern is with that extra $mathsfEhat Z_N-1^2$ on the denominator. Where does it come from?
â Hans
Jul 15 at 23:29
@Hans Look at this question or its older version.
â d.k.o.
Jul 16 at 1:39
@Hans Look at this question or its older version.
â d.k.o.
Jul 16 at 1:39
1
1
Yes. I was about to write about Cantelli's inequality en.wikipedia.org/wiki/Cantelli%27s_inequality which is what your links are about. Thank you.
â Hans
Jul 16 at 5:44
Yes. I was about to write about Cantelli's inequality en.wikipedia.org/wiki/Cantelli%27s_inequality which is what your links are about. Thank you.
â Hans
Jul 16 at 5:44
 |Â
show 1 more 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%2f1357078%2frandom-walk-threshold-problem-with-a-time-dependent-threshold%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