Random Walk on Nonnegative Integers
A particle performs a random walk on the non-negative integers as follows. When at the point n (> 0) its next position is uniformly distributed on the set {0, 1, 2,..., n + 1}. When it hits 0 for the first time, it is absorbed. Suppose it starts at the point a. Find the probability that its position never exceeds a.
Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.
- unanswered
- 468 views
- Pro Bono
Related Questions
- Compound Interest with monthly added capital
- Markov Chain Question
- foundations in probability
- Multiple comparisons problem
- Goalscorer Probability question
- [Combinatorics] Selections, Distributions, and Arrangements with Multiple Restrictions
- Topic: Large deviations, in particular: Sanov's theorem
- joint continuous probability function finding covariance
Such advanced question warrants a bounty of 25$ I believe