Sparse reconstruction in spin systems I: iid spins

10/20/2020
by   Pál Galicza, et al.
0

For a sequence of Boolean functions f_n : {-1,1}^V_n⟶{-1,1}, defined on increasing configuration spaces of random inputs, we say that there is sparse reconstruction if there is a sequence of subsets U_n ⊆ V_n of the coordinates satisfying |U_n| = o(|V_n|) such that knowing the coordinates in U_n gives us a non-vanishing amount of information about the value of f_n. We first show that, if the underlying measure is a product measure, then no sparse reconstruction is possible for any sequence of transitive functions. We discuss the question in different frameworks, measuring information content in L^2 and with entropy. We also highlight some interesting connections with cooperative game theory. Beyond transitive functions, we show that the left-right crossing event for critical planar percolation on the square lattice does not admit sparse reconstruction either. Some of these results answer questions posed by Itai Benjamini.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2023

Generalized Polymorphisms

We determine all m-ary Boolean functions f_0,…,f_m and n-ary Boolean fun...
research
09/25/2018

Sparse Circular Coordinates via Principal Z-Bundles

We present in this paper an application of the theory of principal bundl...
research
06/14/2023

Learning to Predict Scene-Level Implicit 3D from Posed RGBD Data

We introduce a method that can learn to predict scene-level implicit fun...
research
02/25/2020

A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions

We prove two new results about the randomized query complexity of compos...
research
11/15/2022

About the Reconstruction of Convex Lattice Sets from One or Two X-rays

We consider a class of problems of Discrete Tomography which has been de...
research
02/21/2017

Column normalization of a random measurement matrix

In this note we answer a question of G. Lecué, by showing that column no...
research
11/14/2019

A regression algorithm for accelerated lattice QCD that exploits sparse inference on the D-Wave quantum annealer

We propose a regression algorithm that utilizes a learned dictionary opt...

Please sign up or login with your details

Forgot password? Click here to reset