Related papers: Entropy-efficient finitary codings
We consider determinantal point processes on the $d$-dimensional unit sphere $\mathbb S^d$. These are finite point processes exhibiting repulsiveness and with moment properties determined by a certain determinant whose entries are specified…
Given a finitely generated amenable group we consider ergodic random Schr\"odinger operators on a Cayley graph with random potentials and random boundary conditions. We show that the normalised eigenvalue counting functions of finite volume…
We construct two new classes of topological dynamical systems; one is a factor of a one-sided shift of finite type while the second is a factor of the two-sided shift. The data is a finite graph which presents the shift of finite type, a…
Entropy and differential entropy are important quantities in information theory. A tractable extension to singular random variables-which are neither discrete nor continuous-has not been available so far. Here, we present such an extension…
We show that every isometric action on a Cantor set is conjugate to an inverse limit of actions on finite sets; and that every isometric action by a finitely generated amenable group is residually finite.
The main purpose of this article is to provide a common generalization of the notions of a topological and Kolmogorov-Sinai entropy for arbitrary representations of discrete amenable groups on objects of (abstract) categories. This is…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
In contrast to the canonical ensemble where thermodynamic functions are smooth for all finite system sizes, the microcanonical entropy can show nonanalytic points also for finite systems, even if the Hamiltonian is smooth. The relation…
We investigate the problem of safety verification of infinite-state parameterized programs that are formed based on a rich class of topologies. We introduce a new proof system, called parametric proof spaces, which exploits the underlying…
We consider a generalisation of the self-affine iterated function systems of Lalley and Gatzouras by allowing for a countable infinity of non-conformal contractions. It is shown that the Hausdorff dimension of the limit set is equal to the…
Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…
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…
Comparison-based algorithms are algorithms for which the execution of each operation is solely based on the outcome of a series of comparisons between elements. Comparison-based computations can be naturally represented via the following…
We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and grows at least linearly. We prove that conversely, every…
We show that including degrees of a particular kind of provability in the search target for any theorem-prover in sufficiently powerful formal systems over finite-sized statements preserves well-definition and a sufficient consistency while…
Entropy is a central concept in physics, but can be challenging to calculate even for systems that are easily simulated. This is exacerbated out of equilibrium, where generally little is known about the distribution characterizing simulated…
This paper is a sequel to Chaika and Krishnan [arXiv:1612.00434]. We again consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice Z^d. We assume that once walks meet, they…
Uniformly finite homology is a coarse invariant for metric spaces; in particular, it is a quasi-isometry invariant for finitely generated groups. In this article, we study uniformly finite homology of finitely generated amenable groups and…
We prove that there exists a positive, explicit function $F(k, E)$ such that, for any group $G$ admitting a $k$-acylindrical splitting and any generating set $S$ of $G$ with $\mathrm{Ent}(G,S)<E$, we have $|S| \leq F(k, E)$. We deduce…
We propose a novel family of entanglement measures for time-separated subsystems. Our definitions are applicable to any quantum system, continuous or discrete. To illustrate their utility, we derive upper and lower bounds on time-separated…