REVIEW 1 cited by
Typical sofic entropy and local limits for free group shift systems
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We show that for any invariant measure $\mu$ on a free group shift system, there are two numbers $h^\flat \leq h^\sharp$ which in some sense are the typical upper and lower sofic entropy values. We also give a condition under which $h^\flat = h^\sharp = \mathrm{f}(\mu)$, where $\mathrm{f}$ is the annealed entropy (also called the f invariant). This can be used to compute typical local limits of finitary Gibbs states over sequences of random regular graphs. As examples, we work out typical local limits of the Ising and Potts models. We also show that, for Markov chains, the Kesten--Stigum second-eigenvalue reconstruction criterion actually implies there are no good models over a typical sofic approximation (i.e. $h^\sharp = -\infty$). In particular, we have an exact value for the typical entropy $h^\flat = h^\sharp$ of the free-boundary Ising state: it is equal to the annealed entropy $\mathrm{f}$ for interaction strengths up to the reconstruction threshold, after which it drops abruptly to $-\infty$.
Forward citations
Cited by 1 Pith paper
-
Characterizing the limiting critical Potts measures on locally regular-tree-like expander graphs
At the critical line, local weak limits of Potts and random cluster measures on locally tree-like expander graphs are exactly mixtures of the free and wired tree Gibbs measures, and any mixture weight is realizable.
Discussion (0). Continue with ORCID to comment.