Algebraic dynamical systems from LDPC codes satisfy a strong negation of the weak Pinsker property

Abstract

We construct an explicit algebraic example of a subshift of finite type over a group $\Gamma$ with an invariant Markov measure which has completely positive sofic entropy (with respect to `most' sofic approximations) and yet does not have a direct Bernoulli factor, because its model spaces shatter into exponentially many clusters of sub-exponential size. The example and its analysis are related to random low-density parity-check (LDPC) codes.

Version 3: post-referee report

References in corpus (6)

• Gibbs States and the Set of Solutions of Random Constraint Satisfaction Problems
• The Overlap Gap Property: a Geometric Barrier to Optimizing over Random Structures
• On independent sets in random graphs
• Fuglede-Kadison Determinants and Sofic Entropy
• Examples in the entropy theory of countable group actions
• Measure concentration and the weak Pinsker property