English

Sparse reconstruction in spin systems II: Ising and other factor of IID measures

Probability 2025-06-23 v2 Mathematical Physics Combinatorics Dynamical Systems math.MP

Abstract

For a sequence of Boolean functions fn:{1,1}Vn{1,1}f_n : \{-1, 1\}^{V_n} \longrightarrow \{-1, 1\}, with random input given by some probability measure Pn\mathbb{P}_n, we say that there is sparse reconstruction for fnf_n if there is a sequence of subsets UnVnU_n \subseteq V_n of coordinates satisfying Un=o(Vn)|U_n| = o(|V_n|) such that knowing the spins in UnU_n gives us a non-vanishing amount of information about the value of fnf_n. In the first part of this work, we showed that if the Pn\mathbb{P}_ns are product measures, then no sparse reconstruction is possible for any sequence of transitive functions. In this sequel, we consider spin systems that are relatives of IID measures in one way or another, with our main focus being on the Ising model on finite transitive graphs or exhaustions of lattices. We prove that no sparse reconstruction is possible for the entire high temperature regime on Euclidean boxes and the Curie-Weiss model, while sparse reconstruction for the majority function of the spins is possible in the critical and low temperature regimes. We give quantitative bounds for two-dimensional boxes and the Curie-Weiss model, sharp in the latter case. The proofs employ several different methods, including factor of IID and FK random cluster representations, strong spatial mixing, a generalization of discrete Fourier analysis to Divide-and-Color models, and entropy inequalities.

Keywords

Cite

@article{arxiv.2406.09232,
  title  = {Sparse reconstruction in spin systems II: Ising and other factor of IID measures},
  author = {Pál Galicza and Gábor Pete},
  journal= {arXiv preprint arXiv:2406.09232},
  year   = {2025}
}

Comments

77 pages. Minor corrections throughout, and a small reorganization that includes a change in the numbering of the Open Problems. To appear in Probability Theory & Related Fields