Gamblers ruin difference equation says he'll never reach goal if $p=frac 1 2$

Multi tool use
$begingroup$
I was reading about the gamblers ruin problem here, and they approach it with a difference equation.
The issue is that when I plug $p=frac 1 2$, I get that the probability that the gambler will ever reach his goal becomes zero which is clearly not true.
Here is how I'm getting that:
The gambler starts with $a$ dollars and aims to get to $c$ dollars. He tosses a coin that has a probability $p$ of heads until he reaches either $c$ or $0$. The difference equation is given by:
$$s_c(a) = p s_c(a+1)+ (1-p)s_c(a-1)$$
Then, assuming $s_c(a) = z^n$ we get the characteristic polynomial:
$$pz^2-z+(1-p) = 0$$
We get the two solutions: $z = 1$, $z=frac 1 p -1$.
So the general solution becomes:
$$s_c(a) = c_1 + c_2left(frac 1 p - 1right)^a$$
Then we plug in the boundary conditions, one of which is $s_c(0)=0$.
Now here is where things get weird. If we plug $p =frac 1 2$, the equation becomes:
$$s_c(a) = c_1$$
And since we know $s_c(0)=0$, this means $c_1 = 0$. So this implies that for $p=frac 1 2$, $s_c(a)=0$. But this is obviously not true. What am I missing here?
probability sequences-and-series markov-chains
$endgroup$
add a comment |
$begingroup$
I was reading about the gamblers ruin problem here, and they approach it with a difference equation.
The issue is that when I plug $p=frac 1 2$, I get that the probability that the gambler will ever reach his goal becomes zero which is clearly not true.
Here is how I'm getting that:
The gambler starts with $a$ dollars and aims to get to $c$ dollars. He tosses a coin that has a probability $p$ of heads until he reaches either $c$ or $0$. The difference equation is given by:
$$s_c(a) = p s_c(a+1)+ (1-p)s_c(a-1)$$
Then, assuming $s_c(a) = z^n$ we get the characteristic polynomial:
$$pz^2-z+(1-p) = 0$$
We get the two solutions: $z = 1$, $z=frac 1 p -1$.
So the general solution becomes:
$$s_c(a) = c_1 + c_2left(frac 1 p - 1right)^a$$
Then we plug in the boundary conditions, one of which is $s_c(0)=0$.
Now here is where things get weird. If we plug $p =frac 1 2$, the equation becomes:
$$s_c(a) = c_1$$
And since we know $s_c(0)=0$, this means $c_1 = 0$. So this implies that for $p=frac 1 2$, $s_c(a)=0$. But this is obviously not true. What am I missing here?
probability sequences-and-series markov-chains
$endgroup$
$begingroup$
No matter, it's a constant and the constant is 0.
$endgroup$
– Rohit Pandey
Dec 16 '18 at 5:50
add a comment |
$begingroup$
I was reading about the gamblers ruin problem here, and they approach it with a difference equation.
The issue is that when I plug $p=frac 1 2$, I get that the probability that the gambler will ever reach his goal becomes zero which is clearly not true.
Here is how I'm getting that:
The gambler starts with $a$ dollars and aims to get to $c$ dollars. He tosses a coin that has a probability $p$ of heads until he reaches either $c$ or $0$. The difference equation is given by:
$$s_c(a) = p s_c(a+1)+ (1-p)s_c(a-1)$$
Then, assuming $s_c(a) = z^n$ we get the characteristic polynomial:
$$pz^2-z+(1-p) = 0$$
We get the two solutions: $z = 1$, $z=frac 1 p -1$.
So the general solution becomes:
$$s_c(a) = c_1 + c_2left(frac 1 p - 1right)^a$$
Then we plug in the boundary conditions, one of which is $s_c(0)=0$.
Now here is where things get weird. If we plug $p =frac 1 2$, the equation becomes:
$$s_c(a) = c_1$$
And since we know $s_c(0)=0$, this means $c_1 = 0$. So this implies that for $p=frac 1 2$, $s_c(a)=0$. But this is obviously not true. What am I missing here?
probability sequences-and-series markov-chains
$endgroup$
I was reading about the gamblers ruin problem here, and they approach it with a difference equation.
The issue is that when I plug $p=frac 1 2$, I get that the probability that the gambler will ever reach his goal becomes zero which is clearly not true.
Here is how I'm getting that:
The gambler starts with $a$ dollars and aims to get to $c$ dollars. He tosses a coin that has a probability $p$ of heads until he reaches either $c$ or $0$. The difference equation is given by:
$$s_c(a) = p s_c(a+1)+ (1-p)s_c(a-1)$$
Then, assuming $s_c(a) = z^n$ we get the characteristic polynomial:
$$pz^2-z+(1-p) = 0$$
We get the two solutions: $z = 1$, $z=frac 1 p -1$.
So the general solution becomes:
$$s_c(a) = c_1 + c_2left(frac 1 p - 1right)^a$$
Then we plug in the boundary conditions, one of which is $s_c(0)=0$.
Now here is where things get weird. If we plug $p =frac 1 2$, the equation becomes:
$$s_c(a) = c_1$$
And since we know $s_c(0)=0$, this means $c_1 = 0$. So this implies that for $p=frac 1 2$, $s_c(a)=0$. But this is obviously not true. What am I missing here?
probability sequences-and-series markov-chains
probability sequences-and-series markov-chains
edited Dec 16 '18 at 6:45
Rohit Pandey
asked Dec 16 '18 at 5:35


Rohit PandeyRohit Pandey
1,4421023
1,4421023
$begingroup$
No matter, it's a constant and the constant is 0.
$endgroup$
– Rohit Pandey
Dec 16 '18 at 5:50
add a comment |
$begingroup$
No matter, it's a constant and the constant is 0.
$endgroup$
– Rohit Pandey
Dec 16 '18 at 5:50
$begingroup$
No matter, it's a constant and the constant is 0.
$endgroup$
– Rohit Pandey
Dec 16 '18 at 5:50
$begingroup$
No matter, it's a constant and the constant is 0.
$endgroup$
– Rohit Pandey
Dec 16 '18 at 5:50
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
What you are missing is that if $p=frac{1}{2}$, then the two roots of the characteristic polynomial coincide. The general solution becomes $$s_c(n)=c_11^n + c_2n1^n=c_1+nc_2$$
$endgroup$
$begingroup$
That makes sense. What is the reasoning for this though?
$endgroup$
– Rohit Pandey
Dec 16 '18 at 5:58
2
$begingroup$
This is the standard technique for repeated roots. See, e.g., brilliant.org/wiki/linear-recurrence-relations
$endgroup$
– vadim123
Dec 16 '18 at 6:01
add a comment |
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%2f3042273%2fgamblers-ruin-difference-equation-says-hell-never-reach-goal-if-p-frac-1-2%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
What you are missing is that if $p=frac{1}{2}$, then the two roots of the characteristic polynomial coincide. The general solution becomes $$s_c(n)=c_11^n + c_2n1^n=c_1+nc_2$$
$endgroup$
$begingroup$
That makes sense. What is the reasoning for this though?
$endgroup$
– Rohit Pandey
Dec 16 '18 at 5:58
2
$begingroup$
This is the standard technique for repeated roots. See, e.g., brilliant.org/wiki/linear-recurrence-relations
$endgroup$
– vadim123
Dec 16 '18 at 6:01
add a comment |
$begingroup$
What you are missing is that if $p=frac{1}{2}$, then the two roots of the characteristic polynomial coincide. The general solution becomes $$s_c(n)=c_11^n + c_2n1^n=c_1+nc_2$$
$endgroup$
$begingroup$
That makes sense. What is the reasoning for this though?
$endgroup$
– Rohit Pandey
Dec 16 '18 at 5:58
2
$begingroup$
This is the standard technique for repeated roots. See, e.g., brilliant.org/wiki/linear-recurrence-relations
$endgroup$
– vadim123
Dec 16 '18 at 6:01
add a comment |
$begingroup$
What you are missing is that if $p=frac{1}{2}$, then the two roots of the characteristic polynomial coincide. The general solution becomes $$s_c(n)=c_11^n + c_2n1^n=c_1+nc_2$$
$endgroup$
What you are missing is that if $p=frac{1}{2}$, then the two roots of the characteristic polynomial coincide. The general solution becomes $$s_c(n)=c_11^n + c_2n1^n=c_1+nc_2$$
answered Dec 16 '18 at 5:55
vadim123vadim123
76.3k897191
76.3k897191
$begingroup$
That makes sense. What is the reasoning for this though?
$endgroup$
– Rohit Pandey
Dec 16 '18 at 5:58
2
$begingroup$
This is the standard technique for repeated roots. See, e.g., brilliant.org/wiki/linear-recurrence-relations
$endgroup$
– vadim123
Dec 16 '18 at 6:01
add a comment |
$begingroup$
That makes sense. What is the reasoning for this though?
$endgroup$
– Rohit Pandey
Dec 16 '18 at 5:58
2
$begingroup$
This is the standard technique for repeated roots. See, e.g., brilliant.org/wiki/linear-recurrence-relations
$endgroup$
– vadim123
Dec 16 '18 at 6:01
$begingroup$
That makes sense. What is the reasoning for this though?
$endgroup$
– Rohit Pandey
Dec 16 '18 at 5:58
$begingroup$
That makes sense. What is the reasoning for this though?
$endgroup$
– Rohit Pandey
Dec 16 '18 at 5:58
2
2
$begingroup$
This is the standard technique for repeated roots. See, e.g., brilliant.org/wiki/linear-recurrence-relations
$endgroup$
– vadim123
Dec 16 '18 at 6:01
$begingroup$
This is the standard technique for repeated roots. See, e.g., brilliant.org/wiki/linear-recurrence-relations
$endgroup$
– vadim123
Dec 16 '18 at 6:01
add a comment |
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%2f3042273%2fgamblers-ruin-difference-equation-says-hell-never-reach-goal-if-p-frac-1-2%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
0eP7t Ria9XBpR,1
$begingroup$
No matter, it's a constant and the constant is 0.
$endgroup$
– Rohit Pandey
Dec 16 '18 at 5:50