How can I prove the asymptotic equipartition property (AEP) for an identically distributed markov chain?
$ $ Hi, everyone. I am recently reading the lecture note of EE376a : Information Theory course from Stanford University. This note introduces that we can prove the Asymptotic Equipartition Property (or the Shannon-McMillan-Breiman Theorem) for the case that the given stochastic process $left{ X_n right}$ is a time-invariant discrete-time Markov chain with a finite state space $mathcal{X}$ such that every $X_n$ is identically distributed over $mathcal{X}$ with the distributuion $p$. The following is the statement. :
$$-frac{1}{n} log p(X_1, cdots, X_n) rightarrow H(X_2|X_1)$$
in probability as $n rightarrow infty$. The note introduces the proof of this statement by using Weak Law of Large Numbers for weak dependency. :
Let ${ Y_n }$ be a sequence of identically distributed random variables such that
$$lim_{n rightarrow infty} frac{1}{n^2} sum_{i=1}^{n} sum_{j=1}^{n} Cov[Y_i, Y_j] = 0.$$ Then, $frac{1}{n} sum_{i=1}^{n} Y_i rightarrow mathbb{E}[Y_1]$ in probability as $n rightarrow infty$.
Thus, we let $Y_k := log p(X_k |X_{k-1})$ for $k geq 2$ and $Y_1 := log p(X_1)$. Therefore, it suffices to verify that
$$lim_{n rightarrow infty} frac{1}{n^2} sum_{i=1}^{n} sum_{j=1}^{n} Cov[Y_i, Y_j] = 0 cdots (star)$$
and the statement comes from the WLLN for weak dependency. Now, here is my question. How can I prove the part $(star)$? Please, share some good ideas for this problem.
probability statistics information-theory
asked 2 days ago
shannonentropy
62
New contributor
shannonentropy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
$ $ Hi, everyone. I am recently reading the lecture note of EE376a : Information Theory course from Stanford University. This note introduces that we can prove the Asymptotic Equipartition Property (or the Shannon-McMillan-Breiman Theorem) for the case that the given stochastic process $left{ X_n right}$ is a time-invariant discrete-time Markov chain with a finite state space $mathcal{X}$ such that every $X_n$ is identically distributed over $mathcal{X}$ with the distributuion $p$. The following is the statement. :
$$-frac{1}{n} log p(X_1, cdots, X_n) rightarrow H(X_2|X_1)$$
in probability as $n rightarrow infty$. The note introduces the proof of this statement by using Weak Law of Large Numbers for weak dependency. :
Let ${ Y_n }$ be a sequence of identically distributed random variables such that
$$lim_{n rightarrow infty} frac{1}{n^2} sum_{i=1}^{n} sum_{j=1}^{n} Cov[Y_i, Y_j] = 0.$$ Then, $frac{1}{n} sum_{i=1}^{n} Y_i rightarrow mathbb{E}[Y_1]$ in probability as $n rightarrow infty$.
Thus, we let $Y_k := log p(X_k |X_{k-1})$ for $k geq 2$ and $Y_1 := log p(X_1)$. Therefore, it suffices to verify that
$$lim_{n rightarrow infty} frac{1}{n^2} sum_{i=1}^{n} sum_{j=1}^{n} Cov[Y_i, Y_j] = 0 cdots (star)$$
and the statement comes from the WLLN for weak dependency. Now, here is my question. How can I prove the part $(star)$? Please, share some good ideas for this problem.
probability statistics information-theory
asked 2 days ago
shannonentropy
62
New contributor
shannonentropy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
$ $ Hi, everyone. I am recently reading the lecture note of EE376a : Information Theory course from Stanford University. This note introduces that we can prove the Asymptotic Equipartition Property (or the Shannon-McMillan-Breiman Theorem) for the case that the given stochastic process $left{ X_n right}$ is a time-invariant discrete-time Markov chain with a finite state space $mathcal{X}$ such that every $X_n$ is identically distributed over $mathcal{X}$ with the distributuion $p$. The following is the statement. :
$$-frac{1}{n} log p(X_1, cdots, X_n) rightarrow H(X_2|X_1)$$
in probability as $n rightarrow infty$. The note introduces the proof of this statement by using Weak Law of Large Numbers for weak dependency. :
Let ${ Y_n }$ be a sequence of identically distributed random variables such that
$$lim_{n rightarrow infty} frac{1}{n^2} sum_{i=1}^{n} sum_{j=1}^{n} Cov[Y_i, Y_j] = 0.$$ Then, $frac{1}{n} sum_{i=1}^{n} Y_i rightarrow mathbb{E}[Y_1]$ in probability as $n rightarrow infty$.
Thus, we let $Y_k := log p(X_k |X_{k-1})$ for $k geq 2$ and $Y_1 := log p(X_1)$. Therefore, it suffices to verify that
$$lim_{n rightarrow infty} frac{1}{n^2} sum_{i=1}^{n} sum_{j=1}^{n} Cov[Y_i, Y_j] = 0 cdots (star)$$
and the statement comes from the WLLN for weak dependency. Now, here is my question. How can I prove the part $(star)$? Please, share some good ideas for this problem.
probability statistics information-theory
asked 2 days ago
shannonentropy
62
New contributor
shannonentropy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$ $ Hi, everyone. I am recently reading the lecture note of EE376a : Information Theory course from Stanford University. This note introduces that we can prove the Asymptotic Equipartition Property (or the Shannon-McMillan-Breiman Theorem) for the case that the given stochastic process $left{ X_n right}$ is a time-invariant discrete-time Markov chain with a finite state space $mathcal{X}$ such that every $X_n$ is identically distributed over $mathcal{X}$ with the distributuion $p$. The following is the statement. :
$$-frac{1}{n} log p(X_1, cdots, X_n) rightarrow H(X_2|X_1)$$
in probability as $n rightarrow infty$. The note introduces the proof of this statement by using Weak Law of Large Numbers for weak dependency. :
Let ${ Y_n }$ be a sequence of identically distributed random variables such that
$$lim_{n rightarrow infty} frac{1}{n^2} sum_{i=1}^{n} sum_{j=1}^{n} Cov[Y_i, Y_j] = 0.$$ Then, $frac{1}{n} sum_{i=1}^{n} Y_i rightarrow mathbb{E}[Y_1]$ in probability as $n rightarrow infty$.
Thus, we let $Y_k := log p(X_k |X_{k-1})$ for $k geq 2$ and $Y_1 := log p(X_1)$. Therefore, it suffices to verify that
$$lim_{n rightarrow infty} frac{1}{n^2} sum_{i=1}^{n} sum_{j=1}^{n} Cov[Y_i, Y_j] = 0 cdots (star)$$
and the statement comes from the WLLN for weak dependency. Now, here is my question. How can I prove the part $(star)$? Please, share some good ideas for this problem.
probability statistics information-theory
probability statistics information-theory
asked 2 days ago
shannonentropy
62
New contributor
shannonentropy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 2 days ago
shannonentropy
62
New contributor
shannonentropy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited yesterday
asked 2 days ago
shannonentropy
62
New contributor
shannonentropy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 2 days ago
shannonentropy
62
asked 2 days ago
shannonentropy
62
62
New contributor
shannonentropy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
shannonentropy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
shannonentropy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
0
active
oldest
votes
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
});
}
});
shannonentropy is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3059342%2fhow-can-i-prove-the-asymptotic-equipartition-property-aep-for-an-identically-d%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
shannonentropy is a new contributor. Be nice, and check out our Code of Conduct.
shannonentropy is a new contributor. Be nice, and check out our Code of Conduct.
shannonentropy is a new contributor. Be nice, and check out our Code of Conduct.
shannonentropy is a new contributor. Be nice, and check out our Code of Conduct.
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3059342%2fhow-can-i-prove-the-asymptotic-equipartition-property-aep-for-an-identically-d%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
