Time-dependent Gambler's ruin (coefficient probabilities taken from a probability distribution)
$begingroup$
Consider modifying the standard gambler's ruin recurrence relation (i.e. probability of winning given starting wealth of $i$, maximum exit wealth of $c$, and probability of winning $p$):
$
begin{equation}
u(i) = pu(i+1) + (1-p)u(i-1)
end{equation}
$
I would like to modify the expression above to replace the constant $p$ with with the pmf of some particular distribution (of special interest is the binomial distribution, but happy to look at other distributions as well). Therefore, the recurrence relation now becomes:
$
begin{equation}
u(i) = f(i)u(i+1) + (1-f(i))u(i-1)
end{equation}
$
where $f(i)$ computes the pmf of the binomial distribution over $c$ trials, with exactly $i$ successes, where the probability of a success is $i/c$. In other words,
$
begin{equation}
f(i) = {c choose i}(frac{i}{c})^i(1-frac{i}{c})^{c-i}
end{equation}
$
I've looked around extensively, and very surprisingly I have not seen anyone treat this. Is there a closed-form expression?
probability probability-distributions recurrence-relations markov-chains
$endgroup$
add a comment |
$begingroup$
Consider modifying the standard gambler's ruin recurrence relation (i.e. probability of winning given starting wealth of $i$, maximum exit wealth of $c$, and probability of winning $p$):
$
begin{equation}
u(i) = pu(i+1) + (1-p)u(i-1)
end{equation}
$
I would like to modify the expression above to replace the constant $p$ with with the pmf of some particular distribution (of special interest is the binomial distribution, but happy to look at other distributions as well). Therefore, the recurrence relation now becomes:
$
begin{equation}
u(i) = f(i)u(i+1) + (1-f(i))u(i-1)
end{equation}
$
where $f(i)$ computes the pmf of the binomial distribution over $c$ trials, with exactly $i$ successes, where the probability of a success is $i/c$. In other words,
$
begin{equation}
f(i) = {c choose i}(frac{i}{c})^i(1-frac{i}{c})^{c-i}
end{equation}
$
I've looked around extensively, and very surprisingly I have not seen anyone treat this. Is there a closed-form expression?
probability probability-distributions recurrence-relations markov-chains
$endgroup$
1
$begingroup$
This comment may not be directly related - but some observations. The question reminds me of time dependent random walk and of Wright-Fisher models. Also, just as an observation, it will likely require dealing with law of total total prob/expectation on a case by case depending on the marginal distribution of $p$.
$endgroup$
– Just_to_Answer
Jan 5 at 21:29
add a comment |
$begingroup$
Consider modifying the standard gambler's ruin recurrence relation (i.e. probability of winning given starting wealth of $i$, maximum exit wealth of $c$, and probability of winning $p$):
$
begin{equation}
u(i) = pu(i+1) + (1-p)u(i-1)
end{equation}
$
I would like to modify the expression above to replace the constant $p$ with with the pmf of some particular distribution (of special interest is the binomial distribution, but happy to look at other distributions as well). Therefore, the recurrence relation now becomes:
$
begin{equation}
u(i) = f(i)u(i+1) + (1-f(i))u(i-1)
end{equation}
$
where $f(i)$ computes the pmf of the binomial distribution over $c$ trials, with exactly $i$ successes, where the probability of a success is $i/c$. In other words,
$
begin{equation}
f(i) = {c choose i}(frac{i}{c})^i(1-frac{i}{c})^{c-i}
end{equation}
$
I've looked around extensively, and very surprisingly I have not seen anyone treat this. Is there a closed-form expression?
probability probability-distributions recurrence-relations markov-chains
$endgroup$
Consider modifying the standard gambler's ruin recurrence relation (i.e. probability of winning given starting wealth of $i$, maximum exit wealth of $c$, and probability of winning $p$):
$
begin{equation}
u(i) = pu(i+1) + (1-p)u(i-1)
end{equation}
$
I would like to modify the expression above to replace the constant $p$ with with the pmf of some particular distribution (of special interest is the binomial distribution, but happy to look at other distributions as well). Therefore, the recurrence relation now becomes:
$
begin{equation}
u(i) = f(i)u(i+1) + (1-f(i))u(i-1)
end{equation}
$
where $f(i)$ computes the pmf of the binomial distribution over $c$ trials, with exactly $i$ successes, where the probability of a success is $i/c$. In other words,
$
begin{equation}
f(i) = {c choose i}(frac{i}{c})^i(1-frac{i}{c})^{c-i}
end{equation}
$
I've looked around extensively, and very surprisingly I have not seen anyone treat this. Is there a closed-form expression?
probability probability-distributions recurrence-relations markov-chains
probability probability-distributions recurrence-relations markov-chains
edited Jan 8 at 17:53
ux74bn1
asked Jan 5 at 18:43
ux74bn1ux74bn1
163
163
1
$begingroup$
This comment may not be directly related - but some observations. The question reminds me of time dependent random walk and of Wright-Fisher models. Also, just as an observation, it will likely require dealing with law of total total prob/expectation on a case by case depending on the marginal distribution of $p$.
$endgroup$
– Just_to_Answer
Jan 5 at 21:29
add a comment |
1
$begingroup$
This comment may not be directly related - but some observations. The question reminds me of time dependent random walk and of Wright-Fisher models. Also, just as an observation, it will likely require dealing with law of total total prob/expectation on a case by case depending on the marginal distribution of $p$.
$endgroup$
– Just_to_Answer
Jan 5 at 21:29
1
1
$begingroup$
This comment may not be directly related - but some observations. The question reminds me of time dependent random walk and of Wright-Fisher models. Also, just as an observation, it will likely require dealing with law of total total prob/expectation on a case by case depending on the marginal distribution of $p$.
$endgroup$
– Just_to_Answer
Jan 5 at 21:29
$begingroup$
This comment may not be directly related - but some observations. The question reminds me of time dependent random walk and of Wright-Fisher models. Also, just as an observation, it will likely require dealing with law of total total prob/expectation on a case by case depending on the marginal distribution of $p$.
$endgroup$
– Just_to_Answer
Jan 5 at 21:29
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%2f3063063%2ftime-dependent-gamblers-ruin-coefficient-probabilities-taken-from-a-probabilit%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%2f3063063%2ftime-dependent-gamblers-ruin-coefficient-probabilities-taken-from-a-probabilit%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
1
$begingroup$
This comment may not be directly related - but some observations. The question reminds me of time dependent random walk and of Wright-Fisher models. Also, just as an observation, it will likely require dealing with law of total total prob/expectation on a case by case depending on the marginal distribution of $p$.
$endgroup$
– Just_to_Answer
Jan 5 at 21:29