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
- 301 views
- Pro Bono
Related Questions
- Combinatorics questions- can someone please help?
- [Combinatorics] Selections, Distributions, and Arrangements with Multiple Restrictions
- Three unbiased coins are tossed. What is the probability of getting at most two heads?
- How do we describe an intuitive arithmetic mean that gives the following? (I can't type more than 200 letters)
- Standard Error , P-value
- IRS Game Theory Question
- Operational research : queueing theory
- How would I write an acceptance-rejection algorithm for this problem
Such advanced question warrants a bounty of 25$ I believe