1
$\begingroup$

In my work I've come across the following problem.

For $Y_k\sim\text{Binomial}(X_k,p)$ and $X_0=1$, compute the probability distribution for the following recursion,

$$X_k=X_{k-1}+Y_{k-1}$$

This problem is the same one discussed here.

This distribution has expected value $(1+p)^k$, and if one looks at its histogram, it sort of looks like a log-normal distribution, except over-dispersed. However, I was wondering if anything else was known about it, e.g. a closed form, or an efficient way to compute probabilities that does not require running the full recursion each time.

For those of you who are interested, this is used to model PCR amplification bias, reference.

$\endgroup$
2
  • $\begingroup$ @D.W. I would like a closed form for the distribution of $X_k$, or to be able to compute $P(X_k=n)$ in constant time. $\endgroup$ Commented Mar 8 at 4:04
  • $\begingroup$ @ D.W. the goals are right there, at the end of the paragraph, I also provided a paper which is the motivation for the question, I was trying to model PCR in order to better understand it, if that's not satisfactory then just downvote or vote to close or whatever I don't care. $\endgroup$ Commented Mar 8 at 4:17

0

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.