Local problems on trees from the perspectives of distributed algorithms, finitary factors, and descriptive combinatorics
We study connections between distributed local algorithms, finitary factors of iid processes,
and descriptive combinatorics in the context of regular trees. We extend the Borel …
and descriptive combinatorics in the context of regular trees. We extend the Borel …
FIID homomorphisms and entropy inequalities
arxiv:2407.10006v2 [math.CO] 29 Oct 2024 Page 1 arxiv:2407.10006v2 [math.CO] 29 Oct
2024 FIID HOMOMORPHISMS AND ENTROPY INEQUALITIES ENDRE CSÓKA AND …
2024 FIID HOMOMORPHISMS AND ENTROPY INEQUALITIES ENDRE CSÓKA AND …
Separating complexity classes of LCL problems on grids
We study the complexity of locally checkable labeling (LCL) problems on $\mathbb {Z}^ n $
from the point of view of descriptive set theory, computability theory, and factors of iid Our …
from the point of view of descriptive set theory, computability theory, and factors of iid Our …
Entropy and expansion
Shearer's inequality bounds the sum of joint entropies of random variables in terms of the
total joint entropy. We give another lower bound for the same sum in terms of the individual …
total joint entropy. We give another lower bound for the same sum in terms of the individual …
Sparse reconstruction in spin systems II: Ising and other factor of IID measures
P Galicza, G Pete - arxiv preprint arxiv:2406.09232, 2024 - arxiv.org
For a sequence of Boolean functions $ f_n:\{-1, 1\}^{V_n}\longrightarrow\{-1, 1\} $, with
random input given by some probability measure $\mathbb {P} _n $, we say that there is …
random input given by some probability measure $\mathbb {P} _n $, we say that there is …
Deterministic Distributed algorithms and Descriptive Combinatorics on\Delta-regular trees
We study complexity classes of local problems on regular trees from the perspective of
distributed local algorithms and descriptive combinatorics. We show that, surprisingly, some …
distributed local algorithms and descriptive combinatorics. We show that, surprisingly, some …