Question Regarding Transition Diagram for a Markov Chain
$begingroup$
I am currently reading Introduction to Stochastic Models by Roe Goodman and have come across some unfamiliar notation for illustrating how Markov Chains work for this specific case of flipping a coin.
- It states that the coin shows heads with probability $p$, and I assume that $q$ represents $1 - p$ however this is causing some confusion. Is it assuming that we are starting at heads?
- The state space is either heads or tails, yes? What exactly does the progression of values from zero to three represent, is it the number of heads? That is what my current thought is as the $p$ arrows are to represent the probability of the coin landing on heads, but then this does not exactly hold up as the way $q$ is depicted it makes it seem as if it transitions back to heads with probability $q$.
Any help regarding the interpretations for this diagram is appreciated.
probability probability-theory markov-chains
$endgroup$
add a comment |
$begingroup$
I am currently reading Introduction to Stochastic Models by Roe Goodman and have come across some unfamiliar notation for illustrating how Markov Chains work for this specific case of flipping a coin.
- It states that the coin shows heads with probability $p$, and I assume that $q$ represents $1 - p$ however this is causing some confusion. Is it assuming that we are starting at heads?
- The state space is either heads or tails, yes? What exactly does the progression of values from zero to three represent, is it the number of heads? That is what my current thought is as the $p$ arrows are to represent the probability of the coin landing on heads, but then this does not exactly hold up as the way $q$ is depicted it makes it seem as if it transitions back to heads with probability $q$.
Any help regarding the interpretations for this diagram is appreciated.
probability probability-theory markov-chains
$endgroup$
add a comment |
$begingroup$
I am currently reading Introduction to Stochastic Models by Roe Goodman and have come across some unfamiliar notation for illustrating how Markov Chains work for this specific case of flipping a coin.
- It states that the coin shows heads with probability $p$, and I assume that $q$ represents $1 - p$ however this is causing some confusion. Is it assuming that we are starting at heads?
- The state space is either heads or tails, yes? What exactly does the progression of values from zero to three represent, is it the number of heads? That is what my current thought is as the $p$ arrows are to represent the probability of the coin landing on heads, but then this does not exactly hold up as the way $q$ is depicted it makes it seem as if it transitions back to heads with probability $q$.
Any help regarding the interpretations for this diagram is appreciated.
probability probability-theory markov-chains
$endgroup$
I am currently reading Introduction to Stochastic Models by Roe Goodman and have come across some unfamiliar notation for illustrating how Markov Chains work for this specific case of flipping a coin.
- It states that the coin shows heads with probability $p$, and I assume that $q$ represents $1 - p$ however this is causing some confusion. Is it assuming that we are starting at heads?
- The state space is either heads or tails, yes? What exactly does the progression of values from zero to three represent, is it the number of heads? That is what my current thought is as the $p$ arrows are to represent the probability of the coin landing on heads, but then this does not exactly hold up as the way $q$ is depicted it makes it seem as if it transitions back to heads with probability $q$.
Any help regarding the interpretations for this diagram is appreciated.
probability probability-theory markov-chains
probability probability-theory markov-chains
asked Jan 16 at 16:48
Theodore WeldTheodore Weld
1033
1033
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Based on the diagram, yes $q$ represents $1-p$. This is pretty standard notation.
The example is keeping track of the number of heads. So the state space is ${0,1,2,...}$. You should interpret the diagram as follows: Suppose we're at state $n$. One of two things happens. Either we flip heads, with probability $p$, and advance to state $n+1$. Or we obtain tails, with probability $q$, and stay at state $n$.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
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%2f3075964%2fquestion-regarding-transition-diagram-for-a-markov-chain%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Based on the diagram, yes $q$ represents $1-p$. This is pretty standard notation.
The example is keeping track of the number of heads. So the state space is ${0,1,2,...}$. You should interpret the diagram as follows: Suppose we're at state $n$. One of two things happens. Either we flip heads, with probability $p$, and advance to state $n+1$. Or we obtain tails, with probability $q$, and stay at state $n$.
$endgroup$
add a comment |
$begingroup$
Based on the diagram, yes $q$ represents $1-p$. This is pretty standard notation.
The example is keeping track of the number of heads. So the state space is ${0,1,2,...}$. You should interpret the diagram as follows: Suppose we're at state $n$. One of two things happens. Either we flip heads, with probability $p$, and advance to state $n+1$. Or we obtain tails, with probability $q$, and stay at state $n$.
$endgroup$
add a comment |
$begingroup$
Based on the diagram, yes $q$ represents $1-p$. This is pretty standard notation.
The example is keeping track of the number of heads. So the state space is ${0,1,2,...}$. You should interpret the diagram as follows: Suppose we're at state $n$. One of two things happens. Either we flip heads, with probability $p$, and advance to state $n+1$. Or we obtain tails, with probability $q$, and stay at state $n$.
$endgroup$
Based on the diagram, yes $q$ represents $1-p$. This is pretty standard notation.
The example is keeping track of the number of heads. So the state space is ${0,1,2,...}$. You should interpret the diagram as follows: Suppose we're at state $n$. One of two things happens. Either we flip heads, with probability $p$, and advance to state $n+1$. Or we obtain tails, with probability $q$, and stay at state $n$.
answered Jan 16 at 16:56
pwerthpwerth
3,310417
3,310417
add a comment |
add a comment |
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%2f3075964%2fquestion-regarding-transition-diagram-for-a-markov-chain%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