Entropy inequalities for factors of IID

DOI10.4171/GGD/492zbMath1419.37035arXiv1706.04937OpenAlexW2962971414MaRDI QIDQ2319838

Balázs Gerencsér, Viktor Harangi, Agnes Backhausz

Publication date: 20 August 2019

Published in: Groups, Geometry, and Dynamics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.04937

zbMATH Keywords

entropyrandom variablesMarkov chainregular tree

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Dynamical systems involving maps of trees and graphs (37E25)

Related Items (1)

Entropy and expansion

Cites Work

• Independence ratio and random eigenvectors in transitive graphs
• A measure-conjugacy invariant for free group actions
• The ergodic theory of free group actions: entropy and the \(f\)-invariant
• Local algorithms, regular graphs of large girth, and random regular graphs
• Local algorithms for independent sets are half-optimal
• On the almost eigenvectors of random regular graphs
• Invariant Gaussian processes and independent sets on regular graphs of large girth
• Ramanujan graphings and correlation decay in local algorithms
• The Independence Ratio of Regular Graphs
• Correlation Bounds for Distant Parts of Factor of IID Processes
• On large‐girth regular graphs and random processes on trees
• Mutual information decay for factors of i.i.d.
• Factor of IID Percolation on Trees
• Factors of IID on Trees
• Factors of independent and identically distributed processes with non-amenable group actions

This page was built for publication: Entropy inequalities for factors of IID