Finding the probabiliy that event THTH occurs before HTHH

  • Thread starter Thread starter SeekerofMath
  • Start date Start date
AI Thread Summary
The probability of the sequence THTH occurring before HTHH is calculated to be 9/14 due to the asymmetry in the sequences' appearances during infinite coin tosses. The discussion highlights that while both sequences have equal chances in short trials, longer sequences favor THTH because it can appear multiple times in fewer tosses compared to HTHH. A method involving a transition matrix and eigenvalues is suggested for determining the long-term probabilities of each sequence occurring first. By analyzing the outcomes based on the last three tosses, the probabilities can be simplified to yield the final result. This analysis confirms that THTH is indeed more likely to occur before HTHH.
SeekerofMath
Messages
2
Reaction score
0
I was refreshing myself of the basics of probability on wolfram for coin toss.
mathworld.wolfram.com/CoinTossing.html

At 1) , how did they get 9/14 for the probability that THTH occurs before HTHH ?
 
Physics news on Phys.org
Welcome to PF!

Hi SeekerofMath! Welcome to PF! :smile:
SeekerofMath said:
I was refreshing myself of the basics of probability on wolfram for coin toss.
mathworld.wolfram.com/CoinTossing.html

At 1) , how did they get 9/14 for the probability that THTH occurs before HTHH ?

By working it out! :rolleyes:

Have a go … show us what you get. :smile:
 
I'd like some direction...
 
SeekerofMath said:
I'd like some direction...

if there were only 4 tossing THTH and HTHH would be equally likely but if you consider infinite tossings then things changes:

Now through this infinite serie you will find situations like:

THTHTH (two appearances of THTH in 6 tosses)

Which is not possible for HTHH in just 6 tosses and the best you can do is

HTHHTHH (two appereances of HTHH in 7 tosses)

This asymmetry makes THTH more likely to appear before HTHH, anyway, the actual calculations should be in the reference given by the article you posted, that is (Gardner 1988, p. 64)

Good Luck :)
 
No idea if there's a better way, but here's a method which I believe would give the right answer.
Consider 10 states, X0 to X7, Y, Z.
X0 to X7 represent the outcomes of the last three tosses, TTT, TTH, .. , HHH.
Y, Z represent THTH, HTHH having occurred, first, at some point, respectively.
We take as initial states X0 to X7 equally likely (i.e. result of first 3 tosses).
Thereafter, each toss gives a transition to a new state. If we ever enter Y or Z we stay there. This gives a 10x10 transition matrix.
Extracting the eigenvalues allows us to find the long term odds of being in state Y or Z.
 
haruspex said:
No idea if there's a better way,
Indeed there is...:blushing:

Let p0 be the prob of THTH before HTHH if the last 3 were TTT.
Let p1 be the prob of THTH before HTHH if the last 3 were TTH.
etc. to
Let p7 be the prob of THTH before HTHH if the last 3 were HHH.
By considering the next toss in each case, we get:
p0 = p0/2 + p1/2
p1 = p2/2 + p3/2
p2 = 1/2 + p4/2
p3 = p6/2 + p7/2
p4 = p0/2 + p1/2
p5 = p2/2
p6 = p4/2 + p5/2
p7 = p6/2 + p7/2
This simplifies quite easily to give
p0 = p1 = p4 = 5/7
p2 = 6/7
p3 = p6 = p7 = 4/7
p5 = 3/7
The overall probability of THTH before HTHH is the average of these, 9/14.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...

Similar threads

Back
Top