Related papers: Entropy-efficient finitary codings

We show that for weakly dependent random variables the relative entropy functional satisfies an approximate version of the standard tensorization property which holds in the independent case. As a corollary we obtain a family of…

The $d=2$ critical Ising model is described by an exactly solvable Conformal Field Theory (CFT). The deformation to $d=2+\epsilon$ is a relatively simple system at strong coupling outside of even dimensions. Using novel numerical and…

A topological group G is profinite if it is compact and totally disconnected. Equivalently, G is the inverse limit of a surjective system of finite groups carrying the discrete topology. We discuss how to represent a countably based…

Given a locally finite graph $\Gamma$, an amenable subgroup $G$ of graph automorphisms acting freely and almost transitively on its vertices, and a $G$-invariant activity function $\lambda$, consider the free energy $f_G(\Gamma,\lambda)$ of…

We develop a new framework for establishing approximate factorization of entropy on arbitrary probability spaces, using a geometric notion known as non-negative sectional curvature. The resulting estimates are equivalent to entropy…

Exchangeable arrays are natural tools to model common forms of dependence between units of a sample. Jointly exchangeable arrays are well suited to dyadic data, where observed random variables are indexed by two units from the same…

If $N \subset \R$ is a separable II$_1$-factor, the space $\Hom(N,\R)$ of unitary equivalence classes of unital *-homomorphisms $N \to \R$ is shown to have a surprisingly rich structure. If $N$ is not hyperfinite, $\Hom(N,\R)$ is an…

The concept of a C-approximable group, for a class of finite groups C, is a common generalization of the concepts of a sofic, weakly sofic, and linear sofic group. Glebsky raised the question whether all groups are approximable by finite…

It is well known that if $G$ is a countable amenable group and $G \curvearrowright (Y, \nu)$ factors onto $G \curvearrowright (X, \mu)$, then the entropy of the first action must be greater than or equal to the entropy of the second action.…

We develop a model-theoretic framework for the study of distal factors of strongly ergodic, measure-preserving dynamical systems of countable groups. Our main result is that all such factors are contained in the (existential) algebraic…

Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $\infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called…

Countably infinite groups (with a fixed underlying set) constitute a Polish space $G$ with a suitable metric, hence the Baire category theorem holds in $G$. We study isomorphism invariant subsets of $G$, which we call group properties. We…

We consider the transfer functions describing the input-output relation for a class of linear open quantum systems involving feedback with nonzero time delays. We show how such transfer functions can be factorized into a product of terms…

Let $G,H$ be two countable amenable groups. We introduce the notion of group charts, which gives us a tool to embed an arbitrary $H$-subshift into a $G$-subshift. Using an entropy addition formula derived from this formalism we prove that…

We prove that if $G$ is a countably infinite group and $(L, \lambda)$ and $(K, \kappa)$ are probability spaces having equal Shannon entropy, then the Bernoulli shifts $G \curvearrowright (L^G, \lambda^G)$ and $G \curvearrowright (K^G,…

For each $n\geq 2$, we show that the class of all finite $n$-dimensional partial orders, when expanded with $n$ linear orders which realize the partial order, forms a Fra\"iss\'e class and identify its Fra\"iss\'e limit…

Recently a unified hypothesis of multiparameter universality for the critical behavior of bulk and confined anisotropic systems has been formulated [V. Dohm, Phys. Rev. E {\bf 97}, 062128 (2018)]. We prove the validity of this hypothesis on…

We continue our study of the outer Pinsker factor for probability measure-preserving actions of sofic groups. Using the notion of doubly quenched convergence developed by Austin, we prove that in many cases the outer Pinsker factor of a…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

In a seminal paper (Weitz, 2006), Weitz gave a deterministic fully polynomial approximation scheme for count- ing exponentially weighted independent sets (equivalently, approximating the partition function of the hard-core model from…