Some Shannon-McMillan approximation theorems for Markov chain field on the generalized Bethe tree (Q535516): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
Infinite trees are considered in which any vertex \(i\) at level (distance) \(n\) from the root has the same number \(N(n+1)\) of neighbours \(j\) in \(A(i)\) at the next level for \(n=1,2,\dots\) so that there are \(t(n)=1+N(1)+N(1)N(2)+\cdots+N(1)\cdots N(n)\) vertices in the subtree \(T(n)\) with the root and \(n\) levels. A random field \(X\) is defined on the vertices and takes values in some discrete state space \(S\). A Markov field is given by an initial probability distribution \(q\) on \(S\) for the root and a conditional transition probability matrix \(Q\) on \((S,S)\) for any edge of the tree. Let \(H(n,Q)\) be the average of the conditional entropies of state transitions over edges in \(T(n)\). Convergence properties of \(X\) restricted to \(T(n)\) are considered for increasing \(n\). In particular, conditions are given on a general random field so that \([- \log P(X(i)\) for \(i\) in \(T(n))]/t(n) - H(n,Q)\) converges almost surely to zero as \(n\) tends to infinity. As a consequence, the asymptotic distribution of the states of the vertices in \(T(n)\) is uniform and determined by the expected entropy of state transitions over edges. | |||
Property / review text: Infinite trees are considered in which any vertex \(i\) at level (distance) \(n\) from the root has the same number \(N(n+1)\) of neighbours \(j\) in \(A(i)\) at the next level for \(n=1,2,\dots\) so that there are \(t(n)=1+N(1)+N(1)N(2)+\cdots+N(1)\cdots N(n)\) vertices in the subtree \(T(n)\) with the root and \(n\) levels. A random field \(X\) is defined on the vertices and takes values in some discrete state space \(S\). A Markov field is given by an initial probability distribution \(q\) on \(S\) for the root and a conditional transition probability matrix \(Q\) on \((S,S)\) for any edge of the tree. Let \(H(n,Q)\) be the average of the conditional entropies of state transitions over edges in \(T(n)\). Convergence properties of \(X\) restricted to \(T(n)\) are considered for increasing \(n\). In particular, conditions are given on a general random field so that \([- \log P(X(i)\) for \(i\) in \(T(n))]/t(n) - H(n,Q)\) converges almost surely to zero as \(n\) tends to infinity. As a consequence, the asymptotic distribution of the states of the vertices in \(T(n)\) is uniform and determined by the expected entropy of state transitions over edges. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60J10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60G60 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60B12 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5887680 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Markov chain | |||
Property / zbMATH Keywords: Markov chain / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
random field | |||
Property / zbMATH Keywords: random field / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
rooted tree | |||
Property / zbMATH Keywords: rooted tree / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
entropy | |||
Property / zbMATH Keywords: entropy / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
uniform equipartition property | |||
Property / zbMATH Keywords: uniform equipartition property / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Shannon-McMillan theorem | |||
Property / zbMATH Keywords: Shannon-McMillan theorem / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59267125 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1992949404 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4114551 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An extension of Shannon-McMillan theorem and some limit properties for nonhomogeneous Markov chains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4221651 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4220558 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Entropic aspects of random fields on trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4221662 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some limit properties for Markov chains indexed by a homogeneous tree. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Strong law of large numbers and Shannon-McMillan theorem for Markov chain fields on trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Asymptotic Equipartition Property for Nonhomogeneous Markov Chains Indexed by a Homogeneous Tree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some limit properties of random transition probability for second-order nonhomogeneous Markov chains indexed by a tree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: SOME STRONG LIMIT THEOREMS FOR MARKOV CHAIN FIELDS ON TREES / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5822308 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3997311 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:47, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some Shannon-McMillan approximation theorems for Markov chain field on the generalized Bethe tree |
scientific article |
Statements
Some Shannon-McMillan approximation theorems for Markov chain field on the generalized Bethe tree (English)
0 references
13 May 2011
0 references
Infinite trees are considered in which any vertex \(i\) at level (distance) \(n\) from the root has the same number \(N(n+1)\) of neighbours \(j\) in \(A(i)\) at the next level for \(n=1,2,\dots\) so that there are \(t(n)=1+N(1)+N(1)N(2)+\cdots+N(1)\cdots N(n)\) vertices in the subtree \(T(n)\) with the root and \(n\) levels. A random field \(X\) is defined on the vertices and takes values in some discrete state space \(S\). A Markov field is given by an initial probability distribution \(q\) on \(S\) for the root and a conditional transition probability matrix \(Q\) on \((S,S)\) for any edge of the tree. Let \(H(n,Q)\) be the average of the conditional entropies of state transitions over edges in \(T(n)\). Convergence properties of \(X\) restricted to \(T(n)\) are considered for increasing \(n\). In particular, conditions are given on a general random field so that \([- \log P(X(i)\) for \(i\) in \(T(n))]/t(n) - H(n,Q)\) converges almost surely to zero as \(n\) tends to infinity. As a consequence, the asymptotic distribution of the states of the vertices in \(T(n)\) is uniform and determined by the expected entropy of state transitions over edges.
0 references
Markov chain
0 references
random field
0 references
rooted tree
0 references
entropy
0 references
uniform equipartition property
0 references
Shannon-McMillan theorem
0 references
0 references
0 references
0 references