Entropy inequalities for factors of IID (Q2319838)

From MaRDI portal
Revision as of 08:34, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Entropy inequalities for factors of IID
scientific article

    Statements

    Entropy inequalities for factors of IID (English)
    0 references
    0 references
    0 references
    0 references
    20 August 2019
    0 references
    This paper studies the class of factors of independent and identically distributed processes. For a \(d\)-regular tree \(T_d\), if independent and identically distributed random variables are assigned to the vertices of \(T_d\), each vertex gets another label that banks on the labeled rooted graph as seen from that vertex. The probability distribution on \(M^{V(T_d)}\) is invariant under the automorphism group \(\mathrm{Aut}(T_d)\) of \(T_d\). Let \(T\) be the universal cover of a finite connected graph \(G=(V(G),E(G))\). For a vertex \(v\) of the \(G\), denote by \(\mu_v^X\) the distribution of \(X_{\hat{v}}\) for any lift \(\hat{v}\) of \(v\). For an edge \(e\) of the \(G\), denote by \(\mu_e^X\) the distribution of \((X_{\hat{u}},X_{\hat{v}})\) for any lift \(\hat{e}=(\hat{u},\hat{v})\) of \(e\). It is shown that the Shannon entropies \(H\) of these distributions follow \(\sum_{e\in E(G)}H(\mu_e^X)\ge\sum_{v\in V(G)}(\deg(v)-1)H(\mu_v^X)\), where \(\deg(v)\) is the degree of vertex \(v\) in \(G\).
    0 references
    0 references
    random variables
    0 references
    regular tree
    0 references
    Markov chain
    0 references
    entropy
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references