#+HashtagPLUS
In

Menu

Post image 1
Post image 2
Post image 3
Post image 4
Post image 5
Post image 6
Post image 7
Post image 8
Post image 9
Post image 10
Post image 11
Post image 12
Post image 13
Post image 14
Post image 15
Post image 16
Post image 17
Post image 18
Post image 19
Post image 20
Post image 21
Post image 22
Post image 23
Post image 24
Post image 25
Post image 26
Post image 27
Post image 28
Post image 29
Post image 30
Post image 31
Post image 32
Post image 33
Post image 34
Post image 35
Post image 36
Post image 37
Post image 38
Post image 39
Post image 40
1 / 40
0

Markov Chain Coin Sequence: E[HH] vs E[HTH] Explained

DEV Community: tutorial·White Oak Intelligence·2 days ago
#yyXBrq4G
#dev#flip#flips#expected#state#probability
Reading 0:00
15s threshold

In This Article The Question The Intuition Trap Building the State Machine for HH Solving the System: E[HH] = 6 Building the State Machine for HTH Solving the System: E[HTH] = 10 Why Overlapping Patterns Change Everything Python Simulation: 100,000 Trials Business Application: Credit Migration & Web Ranking The Question You flip a fair coin — one with probability 1/2 of landing heads and 1/2 of landing tails — repeatedly, recording every result. What is the expected number of flips required until the sequence HH appears for the first time as consecutive results? What is the expected number of flips required until HTH appears for the first time? Both questions have the same surface structure: you want a specific consecutive pattern, and you want to know, on average, how many flips it takes to observe it. The coin is fair, the flips are independent, and the patterns are short. These seem like they should yield similar answers. They do not. HH takes exactly 6 flips on average. HTH takes exactly 10.…

Continue reading — create a free account

Join HashtagPLUS to read full articles, follow hashtags, vote, and join the conversation.

Create free accountLog in
Read More