Probability of Random walk with 2 absorbing walls hitting one wall during N steps












0












$begingroup$


Assume a i.i.d. one dimensional random walk S with symmetrical probabilities of $frac{1}{2}$ for a unit plus or minus step. Start is at $S = 0$ and absorbing walls are at $S = - B$ and $S = + A$.



What is the probability $P_a$ that during $N$ steps the particle will be absorbed at $S = A$ before reaching $S = - B$ or escaping unabsorbed. Assume $N > 2A + B$ and assume if necessary $A > B$.



What is the probability $P_u$ that the particle hits neither wall in $N$ steps?



The solution for $N rightarrow infty$ or until particle is absorbed is $P_a = frac{B}{A + B}$. But for finite $N$ this is solved tediously by counting outcomes for specific examples. Can anyone find a closed solution for $P_a$ in terms of $A, B$ and $N$?



This is one of the well-known Gambler's Ruin problems.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    $P_a=(0; 0; ..., 0; 1; 0; ...;0)^TP^N(0;0;...;0;1)$ for $P$ the transition probability matrix, where $x^T$ denotes the transpose of the column vector $x$.
    $endgroup$
    – Michael
    Dec 22 '18 at 2:34












  • $begingroup$
    @Michael Could you please suggest another method? I am not familiar with transition matrix method you suggest. Thanks.
    $endgroup$
    – artbenis
    Jan 2 at 14:30










  • $begingroup$
    Let $S(t)$ be the Markov chain in the state space $mathcal{S}={-b,...,a}$. By the law of total probability $$ underbrace{P[S(t+1)=j]}_{p_j(t+1)}=sum_{iin mathcal{S}} underbrace{P[S(t+1)=j|S(t)=i]}_{P_{ij}}underbrace{P[S(t)=i]}_{p_i(t)}$$ which reduces to $p_j(t+1)=sum_{i in mathcal{S}}p_i(t)P_{ij}$ for all $jin mathcal{S}$. Define row vector $p(t)^T = (p_{-b}(t), ..., p_a(t))$. The matrix version of this is $p(t+1)^T = p(t)^T P$ for all $t in {0, 1, 2, ...}$. So start with $p(0)^T=(0,...,0,1,0,...,0)$ and iteratively multiply by $P$.
    $endgroup$
    – Michael
    Jan 2 at 18:17


















0












$begingroup$


Assume a i.i.d. one dimensional random walk S with symmetrical probabilities of $frac{1}{2}$ for a unit plus or minus step. Start is at $S = 0$ and absorbing walls are at $S = - B$ and $S = + A$.



What is the probability $P_a$ that during $N$ steps the particle will be absorbed at $S = A$ before reaching $S = - B$ or escaping unabsorbed. Assume $N > 2A + B$ and assume if necessary $A > B$.



What is the probability $P_u$ that the particle hits neither wall in $N$ steps?



The solution for $N rightarrow infty$ or until particle is absorbed is $P_a = frac{B}{A + B}$. But for finite $N$ this is solved tediously by counting outcomes for specific examples. Can anyone find a closed solution for $P_a$ in terms of $A, B$ and $N$?



This is one of the well-known Gambler's Ruin problems.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    $P_a=(0; 0; ..., 0; 1; 0; ...;0)^TP^N(0;0;...;0;1)$ for $P$ the transition probability matrix, where $x^T$ denotes the transpose of the column vector $x$.
    $endgroup$
    – Michael
    Dec 22 '18 at 2:34












  • $begingroup$
    @Michael Could you please suggest another method? I am not familiar with transition matrix method you suggest. Thanks.
    $endgroup$
    – artbenis
    Jan 2 at 14:30










  • $begingroup$
    Let $S(t)$ be the Markov chain in the state space $mathcal{S}={-b,...,a}$. By the law of total probability $$ underbrace{P[S(t+1)=j]}_{p_j(t+1)}=sum_{iin mathcal{S}} underbrace{P[S(t+1)=j|S(t)=i]}_{P_{ij}}underbrace{P[S(t)=i]}_{p_i(t)}$$ which reduces to $p_j(t+1)=sum_{i in mathcal{S}}p_i(t)P_{ij}$ for all $jin mathcal{S}$. Define row vector $p(t)^T = (p_{-b}(t), ..., p_a(t))$. The matrix version of this is $p(t+1)^T = p(t)^T P$ for all $t in {0, 1, 2, ...}$. So start with $p(0)^T=(0,...,0,1,0,...,0)$ and iteratively multiply by $P$.
    $endgroup$
    – Michael
    Jan 2 at 18:17
















0












0








0





$begingroup$


Assume a i.i.d. one dimensional random walk S with symmetrical probabilities of $frac{1}{2}$ for a unit plus or minus step. Start is at $S = 0$ and absorbing walls are at $S = - B$ and $S = + A$.



What is the probability $P_a$ that during $N$ steps the particle will be absorbed at $S = A$ before reaching $S = - B$ or escaping unabsorbed. Assume $N > 2A + B$ and assume if necessary $A > B$.



What is the probability $P_u$ that the particle hits neither wall in $N$ steps?



The solution for $N rightarrow infty$ or until particle is absorbed is $P_a = frac{B}{A + B}$. But for finite $N$ this is solved tediously by counting outcomes for specific examples. Can anyone find a closed solution for $P_a$ in terms of $A, B$ and $N$?



This is one of the well-known Gambler's Ruin problems.










share|cite|improve this question











$endgroup$




Assume a i.i.d. one dimensional random walk S with symmetrical probabilities of $frac{1}{2}$ for a unit plus or minus step. Start is at $S = 0$ and absorbing walls are at $S = - B$ and $S = + A$.



What is the probability $P_a$ that during $N$ steps the particle will be absorbed at $S = A$ before reaching $S = - B$ or escaping unabsorbed. Assume $N > 2A + B$ and assume if necessary $A > B$.



What is the probability $P_u$ that the particle hits neither wall in $N$ steps?



The solution for $N rightarrow infty$ or until particle is absorbed is $P_a = frac{B}{A + B}$. But for finite $N$ this is solved tediously by counting outcomes for specific examples. Can anyone find a closed solution for $P_a$ in terms of $A, B$ and $N$?



This is one of the well-known Gambler's Ruin problems.







probability






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 2 at 14:28







artbenis

















asked Dec 22 '18 at 1:23









artbenisartbenis

112




112








  • 1




    $begingroup$
    $P_a=(0; 0; ..., 0; 1; 0; ...;0)^TP^N(0;0;...;0;1)$ for $P$ the transition probability matrix, where $x^T$ denotes the transpose of the column vector $x$.
    $endgroup$
    – Michael
    Dec 22 '18 at 2:34












  • $begingroup$
    @Michael Could you please suggest another method? I am not familiar with transition matrix method you suggest. Thanks.
    $endgroup$
    – artbenis
    Jan 2 at 14:30










  • $begingroup$
    Let $S(t)$ be the Markov chain in the state space $mathcal{S}={-b,...,a}$. By the law of total probability $$ underbrace{P[S(t+1)=j]}_{p_j(t+1)}=sum_{iin mathcal{S}} underbrace{P[S(t+1)=j|S(t)=i]}_{P_{ij}}underbrace{P[S(t)=i]}_{p_i(t)}$$ which reduces to $p_j(t+1)=sum_{i in mathcal{S}}p_i(t)P_{ij}$ for all $jin mathcal{S}$. Define row vector $p(t)^T = (p_{-b}(t), ..., p_a(t))$. The matrix version of this is $p(t+1)^T = p(t)^T P$ for all $t in {0, 1, 2, ...}$. So start with $p(0)^T=(0,...,0,1,0,...,0)$ and iteratively multiply by $P$.
    $endgroup$
    – Michael
    Jan 2 at 18:17
















  • 1




    $begingroup$
    $P_a=(0; 0; ..., 0; 1; 0; ...;0)^TP^N(0;0;...;0;1)$ for $P$ the transition probability matrix, where $x^T$ denotes the transpose of the column vector $x$.
    $endgroup$
    – Michael
    Dec 22 '18 at 2:34












  • $begingroup$
    @Michael Could you please suggest another method? I am not familiar with transition matrix method you suggest. Thanks.
    $endgroup$
    – artbenis
    Jan 2 at 14:30










  • $begingroup$
    Let $S(t)$ be the Markov chain in the state space $mathcal{S}={-b,...,a}$. By the law of total probability $$ underbrace{P[S(t+1)=j]}_{p_j(t+1)}=sum_{iin mathcal{S}} underbrace{P[S(t+1)=j|S(t)=i]}_{P_{ij}}underbrace{P[S(t)=i]}_{p_i(t)}$$ which reduces to $p_j(t+1)=sum_{i in mathcal{S}}p_i(t)P_{ij}$ for all $jin mathcal{S}$. Define row vector $p(t)^T = (p_{-b}(t), ..., p_a(t))$. The matrix version of this is $p(t+1)^T = p(t)^T P$ for all $t in {0, 1, 2, ...}$. So start with $p(0)^T=(0,...,0,1,0,...,0)$ and iteratively multiply by $P$.
    $endgroup$
    – Michael
    Jan 2 at 18:17










1




1




$begingroup$
$P_a=(0; 0; ..., 0; 1; 0; ...;0)^TP^N(0;0;...;0;1)$ for $P$ the transition probability matrix, where $x^T$ denotes the transpose of the column vector $x$.
$endgroup$
– Michael
Dec 22 '18 at 2:34






$begingroup$
$P_a=(0; 0; ..., 0; 1; 0; ...;0)^TP^N(0;0;...;0;1)$ for $P$ the transition probability matrix, where $x^T$ denotes the transpose of the column vector $x$.
$endgroup$
– Michael
Dec 22 '18 at 2:34














$begingroup$
@Michael Could you please suggest another method? I am not familiar with transition matrix method you suggest. Thanks.
$endgroup$
– artbenis
Jan 2 at 14:30




$begingroup$
@Michael Could you please suggest another method? I am not familiar with transition matrix method you suggest. Thanks.
$endgroup$
– artbenis
Jan 2 at 14:30












$begingroup$
Let $S(t)$ be the Markov chain in the state space $mathcal{S}={-b,...,a}$. By the law of total probability $$ underbrace{P[S(t+1)=j]}_{p_j(t+1)}=sum_{iin mathcal{S}} underbrace{P[S(t+1)=j|S(t)=i]}_{P_{ij}}underbrace{P[S(t)=i]}_{p_i(t)}$$ which reduces to $p_j(t+1)=sum_{i in mathcal{S}}p_i(t)P_{ij}$ for all $jin mathcal{S}$. Define row vector $p(t)^T = (p_{-b}(t), ..., p_a(t))$. The matrix version of this is $p(t+1)^T = p(t)^T P$ for all $t in {0, 1, 2, ...}$. So start with $p(0)^T=(0,...,0,1,0,...,0)$ and iteratively multiply by $P$.
$endgroup$
– Michael
Jan 2 at 18:17






$begingroup$
Let $S(t)$ be the Markov chain in the state space $mathcal{S}={-b,...,a}$. By the law of total probability $$ underbrace{P[S(t+1)=j]}_{p_j(t+1)}=sum_{iin mathcal{S}} underbrace{P[S(t+1)=j|S(t)=i]}_{P_{ij}}underbrace{P[S(t)=i]}_{p_i(t)}$$ which reduces to $p_j(t+1)=sum_{i in mathcal{S}}p_i(t)P_{ij}$ for all $jin mathcal{S}$. Define row vector $p(t)^T = (p_{-b}(t), ..., p_a(t))$. The matrix version of this is $p(t+1)^T = p(t)^T P$ for all $t in {0, 1, 2, ...}$. So start with $p(0)^T=(0,...,0,1,0,...,0)$ and iteratively multiply by $P$.
$endgroup$
– Michael
Jan 2 at 18:17












0






active

oldest

votes












Your Answer








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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3049052%2fprobability-of-random-walk-with-2-absorbing-walls-hitting-one-wall-during-n-step%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
















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3049052%2fprobability-of-random-walk-with-2-absorbing-walls-hitting-one-wall-during-n-step%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Plaza Victoria

Puebla de Zaragoza

Musa