Related papers: Finitely dependent processes are finitary
We prove that finitary isomorphisms with finite expectation exist between Bernoulli shifts over the same free group only if the shifts have the same distribution. This generalizes the integer case result of Schmidt. We provide new proofs of…
We consider integer-valued random walks with independent but not identically distributed increments, and extend to this context several classical estimates, including a local limit theorem, precise small-ball estimates (both conditional on…
Chudnovsky, Kim, Oum, and Seymour recently established that any prime graph contains one of a short list of induced prime subgraphs [1]. In the present paper we reprove their theorem using many of the same ideas, but with the key…
We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…
We study unirational algebraic varieties and the fields of rational functions on them. We show that after adding a finite number of variables some of these fields admit an infinitely transitive model. The latter is an algebraic variety with…
We prove that the first homology group of every planar locally transitive finite graph $G$ is a finitely generated ${\rm Aut}(G)$-module and we prove a similar result for the fundamental group of locally finite planar Cayley graphs.…
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…
Consider the sequential testing of binary outcomes. The a posteriori belief process and its objective conditional-probability counterpart generally differ but converge to the same result in well-defined tests. We show that unless the two…
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.…
Infamously, the finite and unrestricted implication problems for the classes of i) functional and inclusion dependencies together, and ii) embedded multivalued dependencies alone are each undecidable. Famously, the restriction of i) to…
We prove that if an ergodic action of a countable group on a probability space admits a generating partition having finite Shannon entropy then it admits a finite generating partition.
An optimal finite-time process drives a given initial distribution to a given final one in a given time at the lowest cost as quantified by total entropy production. We prove that for system with discrete states this optimal process…
We prove that any finite system of interacted automata can not leave some finite arear of Calley graph of periodic group. If group has non-periodic element, then its Calley graph can be explored by some finite automata with 3 pebbles. If…
We prove that any finitely generated elementary amenable group of zero (algebraic) entropy contains a nilpotent subgroup of finite index or, equivalently, any finitely generated elementary amenable group of exponential growth is of…
We derive a necessary and sufficient condition for stochastic processes to have almost periodic finite dimensional distributions; in particular, we obtain characterizations for infinitely divisible processes to be almost periodic in terms…
A language L over a finite alphabet is growth-sensitive (or entropy sensitive) if forbidding any set of subwords F yields a sub-language L^F whose exponential growth rate (entropy) is smaller than that of L. Let (X, E, l) be an infinite,…
We present the main concepts and results for Graph Directed Markov Systems that have a finitely irreducible incidence matrix. We then see how these results change when the incidence matrix is not assumed to be finitely irreducible.
This paper is intended as an introductory survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…
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…
We introduce stochastic and quantum finite-state transducers as computation-theoretic models of classical stochastic and quantum finitary processes. Formal process languages, representing the distribution over a process's behaviors, are…