Use renewal theory for approximation.
$begingroup$
I am confused about how to use renewal theory finding approximations required in the following questions. The questions are:
A fair 4-sided die has sides labelled 1,2,3,4. Let $Y_n$ equal the product of the first n rolls.
Let N be the first n for which $Y_n$ > $10^{100}$.
- Use renewal theory to find a very good approximation to $E(N)$.
- Find the approximate probability that there is no n for which 1,000,000 < $Y_n$ < 2,000,000.
Anyone have a good idea of how to construct a renewal process that make sense, I feel like I can't find a good way to do this.
probability stochastic-processes
asked Dec 19 '18 at 5:19
Muser_HaoMuser_Hao
142
$endgroup$
add a comment |
$begingroup$
I am confused about how to use renewal theory finding approximations required in the following questions. The questions are:
A fair 4-sided die has sides labelled 1,2,3,4. Let $Y_n$ equal the product of the first n rolls.
Let N be the first n for which $Y_n$ > $10^{100}$.
- Use renewal theory to find a very good approximation to $E(N)$.
- Find the approximate probability that there is no n for which 1,000,000 < $Y_n$ < 2,000,000.
Anyone have a good idea of how to construct a renewal process that make sense, I feel like I can't find a good way to do this.
probability stochastic-processes
asked Dec 19 '18 at 5:19
Muser_HaoMuser_Hao
142
$endgroup$
$begingroup$
Note that $log(Y_n)$ is a process with independent increments.
$endgroup$
– Ian
Dec 19 '18 at 5:46
$begingroup$
Would you mind provide more detailed solution?
$endgroup$
– Muser_Hao
Dec 20 '18 at 1:27
$begingroup$
The first part I think will be straightforward, since the steps are a lot smaller than the target point, so you can just approximate by the target point divided by the average step. I'm not so certain what is expected in the second part.
$endgroup$
– Ian
Dec 20 '18 at 20:03
add a comment |
$begingroup$
I am confused about how to use renewal theory finding approximations required in the following questions. The questions are:
A fair 4-sided die has sides labelled 1,2,3,4. Let $Y_n$ equal the product of the first n rolls.
Let N be the first n for which $Y_n$ > $10^{100}$.
- Use renewal theory to find a very good approximation to $E(N)$.
- Find the approximate probability that there is no n for which 1,000,000 < $Y_n$ < 2,000,000.
Anyone have a good idea of how to construct a renewal process that make sense, I feel like I can't find a good way to do this.
probability stochastic-processes
asked Dec 19 '18 at 5:19
Muser_HaoMuser_Hao
142
$endgroup$
I am confused about how to use renewal theory finding approximations required in the following questions. The questions are:
A fair 4-sided die has sides labelled 1,2,3,4. Let $Y_n$ equal the product of the first n rolls.
Let N be the first n for which $Y_n$ > $10^{100}$.
- Use renewal theory to find a very good approximation to $E(N)$.
- Find the approximate probability that there is no n for which 1,000,000 < $Y_n$ < 2,000,000.
Anyone have a good idea of how to construct a renewal process that make sense, I feel like I can't find a good way to do this.
probability stochastic-processes
probability stochastic-processes
asked Dec 19 '18 at 5:19
Muser_HaoMuser_Hao
142
asked Dec 19 '18 at 5:19
Muser_HaoMuser_Hao
142
asked Dec 19 '18 at 5:19
Muser_HaoMuser_Hao
142
asked Dec 19 '18 at 5:19
Muser_HaoMuser_Hao
142
asked Dec 19 '18 at 5:19
Muser_HaoMuser_Hao
142
142
$begingroup$
Note that $log(Y_n)$ is a process with independent increments.
$endgroup$
– Ian
Dec 19 '18 at 5:46
$begingroup$
Would you mind provide more detailed solution?
$endgroup$
– Muser_Hao
Dec 20 '18 at 1:27
$begingroup$
The first part I think will be straightforward, since the steps are a lot smaller than the target point, so you can just approximate by the target point divided by the average step. I'm not so certain what is expected in the second part.
$endgroup$
– Ian
Dec 20 '18 at 20:03
add a comment |
$begingroup$
Note that $log(Y_n)$ is a process with independent increments.
$endgroup$
– Ian
Dec 19 '18 at 5:46
$begingroup$
Would you mind provide more detailed solution?
$endgroup$
– Muser_Hao
Dec 20 '18 at 1:27
$begingroup$
The first part I think will be straightforward, since the steps are a lot smaller than the target point, so you can just approximate by the target point divided by the average step. I'm not so certain what is expected in the second part.
$endgroup$
– Ian
Dec 20 '18 at 20:03
$begingroup$
Note that $log(Y_n)$ is a process with independent increments.
$endgroup$
– Ian
Dec 19 '18 at 5:46
$begingroup$
Note that $log(Y_n)$ is a process with independent increments.
$endgroup$
– Ian
Dec 19 '18 at 5:46
$begingroup$
Would you mind provide more detailed solution?
$endgroup$
– Muser_Hao
Dec 20 '18 at 1:27
$begingroup$
Would you mind provide more detailed solution?
$endgroup$
– Muser_Hao
Dec 20 '18 at 1:27
$begingroup$
The first part I think will be straightforward, since the steps are a lot smaller than the target point, so you can just approximate by the target point divided by the average step. I'm not so certain what is expected in the second part.
$endgroup$
– Ian
Dec 20 '18 at 20:03
$begingroup$
The first part I think will be straightforward, since the steps are a lot smaller than the target point, so you can just approximate by the target point divided by the average step. I'm not so certain what is expected in the second part.
$endgroup$
– Ian
Dec 20 '18 at 20:03
add a comment |
0
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',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3046028%2fuse-renewal-theory-for-approximation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
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
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3046028%2fuse-renewal-theory-for-approximation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
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
Required, but never shown
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
Required, but never shown
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
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Note that $log(Y_n)$ is a process with independent increments.
$endgroup$
– Ian
Dec 19 '18 at 5:46
$begingroup$
Would you mind provide more detailed solution?
$endgroup$
– Muser_Hao
Dec 20 '18 at 1:27
$begingroup$
The first part I think will be straightforward, since the steps are a lot smaller than the target point, so you can just approximate by the target point divided by the average step. I'm not so certain what is expected in the second part.
$endgroup$
– Ian
Dec 20 '18 at 20:03