Searcharxiv⌕ Search

arXiv subjects

Michael Hochman

Publications and source records attributed to Michael Hochman.

39 records · Page 3Linked to original sources

On processes which cannot be distinguished by finitary observation

A function $J$ defined on a family $C$ of stationary processes is finitely observable if there is a sequence of functions $s_n$ such that $s_n(x_1 ... x_n)\to J(X)$ in probability for every process $X=(x_n)\in C$. Recently, Ornstein and Weiss roved the striking result that if $C$ is the class of aperiodic ergodic finite valued processes, then the only finitely observable isomorphism invariant on $C$ is entropy. We sharpen this in several ways. Our main theorem is that if $X \to Y$ is a zero-entropy extension of finite entropy ergodic systems and $C$ is the family of processes arising from $X$ and $Y$, then every finitely observable function on $C$ is constant. This implies Ornstein and Weiss' result, and extends it to many other families of processes, e.g. it shows that there are no nontrivial finitely observable isomorphism invariants for processes arising from Kronecker systems, mild and strong mixing zero entropy systems. It also implies that any finitely observable isomorphism invariant defined on the family of processes arising from irrational rotations must be constant for rotations belonging to a set of full Lebesgue measure.

math.DS↗

Return times, recurrence densities and entropy for actions of some discrete amenable groups

Results of Wyner and Ziv and of Ornstein and Weiss show that if one observes the first k outputs of a finite-valued ergodic process, then the waiting time until this block appears again is almost surely asymptotic to $2^{hk}$, where $h$ is the entropy of the process. We examine this phenomenon when the allowed return times are restricted to some subset of times, and generalize the results to processes parameterized by other discrete amenable groups. We also obtain a uniform density version of the waiting time results: For a process on $s$ symbols, within a given realization, the density of the initial $k$-block within larger $n$-blocks approaches $2^{-hk}$, uniformly in $n>s^k$, as $k$ tends to infinity. Again, similar results hold for processes with other indexing groups.

math.DS↗

Averaging sequences and abelian rank in amenable groups

We investigate the connection between the abelian rank of a countable amenable group and the existence of good averaging sequences (e.g. for the pointwise ergodic theorem). We show that if $G$ is a group of abelian rank $r(G)$ then any Tempel'man sequence must have constant at least $2^{r(G)}$ and if $G$ is abelian this constant is achieved. On the other hand, infinite rank excludes the existence of Tempel'man sequences and forces all tempered sequences to grow super-exponentially.

math.DS↗