Estimating Probability for first appearance of HT before HH and HH before HT using Markov chains Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Probability with Markov chainsEstimate the probability using Markov chainsSupply the transition matrix for these (possible) Markov chainsProbability of a fair sequence of tosses ending on two successive tails given the first toss was a head?Probability of a coin tossed using Markov ChainsFinding chance of winning $A$ is in a alternate throw a fair coin.Probability chains similar to Markov chains but being functions of probability vector.Calculating probability using Markov chainMarkov Chain and ExpectationIntuition behind positive recurrent and null recurrent Markov Chains
Multi tool use
How do living politicians protect their readily obtainable signatures from misuse?
Find 108 by using 3,4,6
Sending unknown callers to voice mail automatically?
What is a fractional matching?
How to write the following sign?
What is "gratricide"?
How do I find out the mythology and history of my Fortress?
How can I reduce the gap between left and right of cdot with a macro?
What is the topology associated with the algebras for the ultrafilter monad?
Time to Settle Down!
Converted a Scalar function to a TVF function for parallel execution-Still running in Serial mode
Trademark violation for app?
Why weren't discrete x86 CPUs ever used in game hardware?
Take 2! Is this homebrew Lady of Pain warlock patron balanced?
Is it fair for a professor to grade us on the possession of past papers?
How to tell that you are a giant?
SF book about people trapped in a series of worlds they imagine
Performance gap between vector<bool> and array
Why wasn't DOSKEY integrated with COMMAND.COM?
Project Euler #1 in C++
Why do early math courses focus on the cross sections of a cone and not on other 3D objects?
Denied boarding although I have proper visa and documentation. To whom should I make a complaint?
How were pictures turned from film to a big picture in a picture frame before digital scanning?
Is it ethical to give a final exam after the professor has quit before teaching the remaining chapters of the course?
Estimating Probability for first appearance of HT before HH and HH before HT using Markov chains
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Probability with Markov chainsEstimate the probability using Markov chainsSupply the transition matrix for these (possible) Markov chainsProbability of a fair sequence of tosses ending on two successive tails given the first toss was a head?Probability of a coin tossed using Markov ChainsFinding chance of winning $A$ is in a alternate throw a fair coin.Probability chains similar to Markov chains but being functions of probability vector.Calculating probability using Markov chainMarkov Chain and ExpectationIntuition behind positive recurrent and null recurrent Markov Chains
$begingroup$
Consider the case where a coin is tossed repeatedly, I win when HH appears for the first time and you win when HT appears for the first time.
I know that one of us will win when the first Head appears so we have a 50-50 chance of winning.
But I recently studied about Markov chain and wanted to know whether it will be applicable here and if it is, I want to know how you can use it calculate the probability who has more probability to win.
I'm new to Markov chains and please help me solve this question
probability markov-chains
asked Mar 27 at 16:51
8056780567
64
$endgroup$
add a comment |
$begingroup$
Consider the case where a coin is tossed repeatedly, I win when HH appears for the first time and you win when HT appears for the first time.
I know that one of us will win when the first Head appears so we have a 50-50 chance of winning.
But I recently studied about Markov chain and wanted to know whether it will be applicable here and if it is, I want to know how you can use it calculate the probability who has more probability to win.
I'm new to Markov chains and please help me solve this question
probability markov-chains
asked Mar 27 at 16:51
8056780567
64
$endgroup$
$begingroup$
The approach you sketch is a Markov chain approach. You are ignoring all the $T's$ you throw before getting that first $H$. That's because the initial Markov state goes back to itself every time you throw a $T$. Once you've thrown an $H$ you are in a new state. Now, whatever happens, the game ends on the next throw.
$endgroup$
– lulu
Mar 27 at 16:59
$begingroup$
To add to @lulu’s comment, you’ll end up with a Markov chain with two absorbing states. The probabilities that you’re looking for are the corresponding absorption probabilities.
$endgroup$
– amd
Mar 27 at 18:40
add a comment |
$begingroup$
Consider the case where a coin is tossed repeatedly, I win when HH appears for the first time and you win when HT appears for the first time.
I know that one of us will win when the first Head appears so we have a 50-50 chance of winning.
But I recently studied about Markov chain and wanted to know whether it will be applicable here and if it is, I want to know how you can use it calculate the probability who has more probability to win.
I'm new to Markov chains and please help me solve this question
probability markov-chains
asked Mar 27 at 16:51
8056780567
64
$endgroup$
Consider the case where a coin is tossed repeatedly, I win when HH appears for the first time and you win when HT appears for the first time.
I know that one of us will win when the first Head appears so we have a 50-50 chance of winning.
But I recently studied about Markov chain and wanted to know whether it will be applicable here and if it is, I want to know how you can use it calculate the probability who has more probability to win.
I'm new to Markov chains and please help me solve this question
probability markov-chains
probability markov-chains
asked Mar 27 at 16:51
8056780567
64
asked Mar 27 at 16:51
8056780567
64
asked Mar 27 at 16:51
8056780567
64
asked Mar 27 at 16:51
8056780567
64
asked Mar 27 at 16:51
8056780567
64
64
$begingroup$
The approach you sketch is a Markov chain approach. You are ignoring all the $T's$ you throw before getting that first $H$. That's because the initial Markov state goes back to itself every time you throw a $T$. Once you've thrown an $H$ you are in a new state. Now, whatever happens, the game ends on the next throw.
$endgroup$
– lulu
Mar 27 at 16:59
$begingroup$
To add to @lulu’s comment, you’ll end up with a Markov chain with two absorbing states. The probabilities that you’re looking for are the corresponding absorption probabilities.
$endgroup$
– amd
Mar 27 at 18:40
add a comment |
$begingroup$
The approach you sketch is a Markov chain approach. You are ignoring all the $T's$ you throw before getting that first $H$. That's because the initial Markov state goes back to itself every time you throw a $T$. Once you've thrown an $H$ you are in a new state. Now, whatever happens, the game ends on the next throw.
$endgroup$
– lulu
Mar 27 at 16:59
$begingroup$
To add to @lulu’s comment, you’ll end up with a Markov chain with two absorbing states. The probabilities that you’re looking for are the corresponding absorption probabilities.
$endgroup$
– amd
Mar 27 at 18:40
$begingroup$
The approach you sketch is a Markov chain approach. You are ignoring all the $T's$ you throw before getting that first $H$. That's because the initial Markov state goes back to itself every time you throw a $T$. Once you've thrown an $H$ you are in a new state. Now, whatever happens, the game ends on the next throw.
$endgroup$
– lulu
Mar 27 at 16:59
$begingroup$
The approach you sketch is a Markov chain approach. You are ignoring all the $T's$ you throw before getting that first $H$. That's because the initial Markov state goes back to itself every time you throw a $T$. Once you've thrown an $H$ you are in a new state. Now, whatever happens, the game ends on the next throw.
$endgroup$
– lulu
Mar 27 at 16:59
$begingroup$
To add to @lulu’s comment, you’ll end up with a Markov chain with two absorbing states. The probabilities that you’re looking for are the corresponding absorption probabilities.
$endgroup$
– amd
Mar 27 at 18:40
$begingroup$
To add to @lulu’s comment, you’ll end up with a Markov chain with two absorbing states. The probabilities that you’re looking for are the corresponding absorption probabilities.
$endgroup$
– amd
Mar 27 at 18:40
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3164767%2festimating-probability-for-first-appearance-of-ht-before-hh-and-hh-before-ht-usi%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3164767%2festimating-probability-for-first-appearance-of-ht-before-hh-and-hh-before-ht-usi%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
AK 1WB4utfVMqpFdtY6ihb29y3PqaJbt mqdmEROvGh,F l,S2G0Oa3FE,QUdQdk f1,R
$begingroup$
The approach you sketch is a Markov chain approach. You are ignoring all the $T's$ you throw before getting that first $H$. That's because the initial Markov state goes back to itself every time you throw a $T$. Once you've thrown an $H$ you are in a new state. Now, whatever happens, the game ends on the next throw.
$endgroup$
– lulu
Mar 27 at 16:59
$begingroup$
To add to @lulu’s comment, you’ll end up with a Markov chain with two absorbing states. The probabilities that you’re looking for are the corresponding absorption probabilities.
$endgroup$
– amd
Mar 27 at 18:40