1

Suppose I have a coin that has:

  • A 0.3 probability of Heads and a 0.7 probability of Tails
  • If Heads, score = score + 1.3 and if Tails, score = score - 0.9
  • Each flip is i.i.d

I am interested in understanding how to analyze the following problems:

  • Problem 1: Suppose the initial score = 0. What is the probability of the score = $n$ after $t$ turns?
  • Problem 2: Given that the score at time $t$ is $n$ (i.e. conditional probability, what is the probability of the score being $m$ at time $t+s$?

Originally, I thought this problem would have had to be analyzed using Random Walks since we are trying to find out the Probability Distribution for the sum of a Binomial Distribution - but now I think that there might be an easier answer.

Here is my attempt:

Problem 1:

Define $ X_i$ as the result of each coin flip .Define the score after $ t$ steps by $ S_t$. Since, $ S_0 = 0$, the score after $ t$ turns can be expressed as: $$ S_t = X_1 + X_2 + \cdots + X_t $$

To find the probability that $S_t = n$, we need to determine the number of Heads ($ k$) and Tails ($ t - k$) that produces a total score of $n$. I tried to write out the algebra as:

$$ 1.3k - 0.9(t - k) = n $$ $$ 1.3k + 0.9k = n + 0.9t $$ $$ 2.2k = n + 0.9t $$ $$ k = \frac{n + 0.9t}{2.2} $$

There is a constraint in this problem that the number of Heads $ k$ must be an integer. If $ k$ is not an integer, the probability is zero. If $ k$ is an integer, the probability should just be a regular Binomial Distribution: $$ P(S_t = n) = P\left(H_t = k\right) = \binom{t}{k} (0.3)^k (0.7)^{t-k} $$

I think we can also drop the constraint and write this as an inequality:

$$ P(S_t \leq n) = P\left(H_t = k\right) = \binom{t}{k} (0.3)^k (0.7)^{t-k} $$

Problem 2: I think that this problem is identical to Problem 1, just with a different constraint equation.

The score difference between time $ t$ and time $ t+s$: $$ S_{t+s} - S_t = m - n $$

Define $ X_s$ as the score change over the next $ s$ flips: $$ X_s = 1.3H_s - 0.9(T_s) $$ where $ H_s$ is the number of Heads and $ T_s = s - H_s$ is the number of Tails in $ s$ flips.

Here is where the equation from Part 1 changes:

$$ 1.3H_s - 0.9(s - H_s) = m - n $$ $$ 1.3H_s + 0.9H_s = m - n + 0.9s $$ $$ 2.2H_s = m - n + 0.9s $$ $$ H_s = \frac{m - n + 0.9s}{2.2} $$

The probability of Heads is given by the Binomial distribution: $$ P(S_{t+s} = m \mid S_t = n) = P\left(H_s = \frac{m - n + 0.9s}{2.2}\right) = \binom{s}{k} (0.3)^k (0.7)^{s-k} $$ where $ k = \frac{m - n + 0.9s}{2.2}$.

We can also write this as an inequality without loss of generality.

Is my reasoning correct? It seems like Random Walks were not necessary in this problem?

  • Note: I think somehow the answers from Question 1 and Question 2 can also be analyzed using a Normal Distribution?
konofoso
  • 681
  • 2
    "I think that this problem is identical to Problem 1, just with a different constraint equation.": close but not exactly. You are given that the score of $~t~$ was achieved after $~n~$ turns which implies that the step 1 relationship between $~n~$ and $~t~$ must hold. Depending on the relationship between the variables $~t, ~n, ~m, ~$ and $~s,~$ you may be able to conclude that the step 2 probability is $~0.~$ That is, the existence of the step 1 type relationship between $~t~$ and $~n~$ may affect whether there can be a step 1 type relationship between $~m~$ and $~s.$ – user2661923 Jul 01 '24 at 06:34
  • @ user2661923: thanks for the notes... if you have time, could you please write a formal answer to this? thank you so much... – konofoso Jul 01 '24 at 17:23
  • 1
    Ordinarily, I would have given a complete answer, rather than just a hint-comment. The difficulty here is that I am out of my depth, never having formally studied probability theory. I do have sufficient intuition to raise the issue in my previous comment. But the mathematical/analytical consideration of it, is simply beyond my abilities. – user2661923 Jul 01 '24 at 18:08
  • @ user2661923 : thank you for your reply... do you think a Random Walk is needed here at all? – konofoso Jul 04 '24 at 02:41
  • I am not qualified to have an opinion here. – user2661923 Jul 04 '24 at 02:43
  • thank you for your honesty - I appreciate your feedback. If you feel like it , perhaps you can upvote the question to attract attention. I am thinking of placing a bounty – konofoso Jul 04 '24 at 03:26

1 Answers1

1

Each heads observed increases the score by $1.3$, and each tails observed decreases the score by $0.9$. Thus, if there are total of $t$ turns, the random score for an initial starting value of $0$ will be $$S(t) = 1.3 X - 0.9 (t-X) = 2.2X - 0.9t,$$ where $$X \sim \operatorname{Binomial}(t, p = 0.3)$$ characterizes the random number of heads observed in $t$ turns. Since $$\Pr[X = x] = \binom{t}{x} (0.3)^x (0.7)^{t-x}, \quad x \in \{0, 1, \ldots, t\},$$ the set of permissible scores is $$S(t) \in \Omega(t) = \{2.2x - 0.9t\}_{x=0}^t;$$ that is, $\Omega(t)$ is the support of $S(t)$. Hence the probability that we have a score $n$ after $t$ turns is $$\begin{align} \Pr[S(t) = n] &= \Pr[2.2X - 0.9t = n] \\ &= \Pr\left[X = \frac{10n + 9t}{22}\right] \\ &= \binom{t}{\frac{10n + 9t}{22}} (0.3)^{(10n + 9t)/22} (0.7)^{(13t - 10n)/22}, \quad n \in \Omega(t), \end{align}$$ and $0$ otherwise.

So for instance, if $t = 7$, we have $\Omega(7) = \{-6.3, -4.1, -1.9, 0.3, 2.5, 4.7, 6.9, 9.1\}$, and $$\Pr[S(7) = 0.3] = \Pr[X = 3] = \binom{7}{3}(0.3)^3 (0.7)^4 = \frac{453789}{2000000} \approx 0.226895.$$ In other words, it is easier to conceptualize the desired probability in terms of the corresponding $X$ for which $S(t) = n$.

Regarding the conditional probability of the second question, it is $$\Pr[S(t+s) = m \mid S(t) = n] = \frac{\Pr[S(t+s) = m \cap S(t) = n]}{\Pr[S(t) = n]} = \frac{\Pr[S(s) = m-n]}{\Pr[S(t) = n]}.$$ Then we apply the formula above.

heropup
  • 143,828
  • @ heropup: thank you so much! Based on this question, I had started working on my next one : https://math.stackexchange.com/questions/4941455/probability-generating-functions-for-coin-flip-problems . can you please tell me if I am on the right track? – konofoso Jul 04 '24 at 04:53