Supremum of absolute value of Brownian Motion
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
I know that by the reflection principle,
$$
Pleft[sup_0 < s < t B_s > a right] = 2P[B_t> a]
$$
where $B_t$ is a Brownian Motion. But what is $Pleft[sup_0 < s < t |B_s|> a right]$?
brownian-motion
add a comment |Â
up vote
0
down vote
favorite
I know that by the reflection principle,
$$
Pleft[sup_0 < s < t B_s > a right] = 2P[B_t> a]
$$
where $B_t$ is a Brownian Motion. But what is $Pleft[sup_0 < s < t |B_s|> a right]$?
brownian-motion
1
Hint: $B_t$ has the same distribution as $-B_t$ and $P(sup_0 < s < t |B_s| > a) = P(sup_0 < s < tB_t > a$ or $inf_0 < s < t B_t < -a)$. Use a union bound--for your previous question, you just need to bound this probability, you do not need to know the probability exactly.
– Chris Janjigian
Jul 30 at 16:52
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I know that by the reflection principle,
$$
Pleft[sup_0 < s < t B_s > a right] = 2P[B_t> a]
$$
where $B_t$ is a Brownian Motion. But what is $Pleft[sup_0 < s < t |B_s|> a right]$?
brownian-motion
I know that by the reflection principle,
$$
Pleft[sup_0 < s < t B_s > a right] = 2P[B_t> a]
$$
where $B_t$ is a Brownian Motion. But what is $Pleft[sup_0 < s < t |B_s|> a right]$?
brownian-motion
asked Jul 30 at 16:07
Tohiko
1245
1245
1
Hint: $B_t$ has the same distribution as $-B_t$ and $P(sup_0 < s < t |B_s| > a) = P(sup_0 < s < tB_t > a$ or $inf_0 < s < t B_t < -a)$. Use a union bound--for your previous question, you just need to bound this probability, you do not need to know the probability exactly.
– Chris Janjigian
Jul 30 at 16:52
add a comment |Â
1
Hint: $B_t$ has the same distribution as $-B_t$ and $P(sup_0 < s < t |B_s| > a) = P(sup_0 < s < tB_t > a$ or $inf_0 < s < t B_t < -a)$. Use a union bound--for your previous question, you just need to bound this probability, you do not need to know the probability exactly.
– Chris Janjigian
Jul 30 at 16:52
1
1
Hint: $B_t$ has the same distribution as $-B_t$ and $P(sup_0 < s < t |B_s| > a) = P(sup_0 < s < tB_t > a$ or $inf_0 < s < t B_t < -a)$. Use a union bound--for your previous question, you just need to bound this probability, you do not need to know the probability exactly.
– Chris Janjigian
Jul 30 at 16:52
Hint: $B_t$ has the same distribution as $-B_t$ and $P(sup_0 < s < t |B_s| > a) = P(sup_0 < s < tB_t > a$ or $inf_0 < s < t B_t < -a)$. Use a union bound--for your previous question, you just need to bound this probability, you do not need to know the probability exactly.
– Chris Janjigian
Jul 30 at 16:52
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Â
draft saved
draft discarded
Â
draft saved
draft discarded
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%2f2867162%2fsupremum-of-absolute-value-of-brownian-motion%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
1
Hint: $B_t$ has the same distribution as $-B_t$ and $P(sup_0 < s < t |B_s| > a) = P(sup_0 < s < tB_t > a$ or $inf_0 < s < t B_t < -a)$. Use a union bound--for your previous question, you just need to bound this probability, you do not need to know the probability exactly.
– Chris Janjigian
Jul 30 at 16:52