Related papers: Simple and large equivalence relations
We present a general new method for constructing pointwise ergodic sequences on countable groups, which is applicable to amenable as well as to non-amenable groups and treats both cases on an equal footing. The principle underlying the…
An ergodic p.m.p. equivalence relation $ \mathcal{R}$ is said to be stable if $\mathcal{R} \cong \mathcal{R} \times \mathcal{R}_0$ where $\mathcal{R}_0$ is the unique hyperfinite ergodic type $\mathrm{II}_1$ equivalence relation. We prove…
The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations $R$ and $S$ on natural numbers, $R$ is computably…
A simple proof of the fact that each rank-one infinite measure preserving (i.m.p.) transformation is subsequence weakly rationally ergodic is found. Some classes of funny rank-one i.m.p. actions of Abelian groups are shown to be subsequence…
We consider probability measure preserving discrete groupoids, group actions and equivalence relations in the context of general probability spaces. We study for these objects the notions of cost, $\beta$-invariant and some…
For a quantum-mechanical counting process we show ergodicity, under the condition that the underlying open quantum system approaches equilibrium in the time mean. This implies equality of time average and ensemble average for correlation…
A collection of integer sequences is jointly ergodic if for every ergodic measure preserving system the multiple ergodic averages, with iterates given by this collection of sequences, converge in the mean to the product of the integrals. We…
We establish an Ergodic Theorem for lower probabilities, a generalization of standard probabilities widely used in applications. As a by-product, we provide a version for lower probabilities of the Strong Law of Large Numbers.
The joint ergodicity classification problem aims to characterize those sequences which are jointly ergodic along an arbitrary dynamical system if and only if they satisfy two natural, simpler-to-verify conditions on this system. These two…
Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility $\leq_c$. This gives rise to a rich degree-structure. In this…
We initiate the study of effective pointwise ergodic theorems in resource-bounded settings. Classically, the convergence of the ergodic averages for integrable functions can be arbitrarily slow. In contrast, we show that for a class of…
We extend the notion of rational ergodicity to $\beta$-rational ergodicity for $\beta > 1$. Given $\beta \in \mathbb R$ such that $\beta > 1$, we construct an uncountable family of rank-one infinite measure preserving transformations that…
We prove that certain Gibbs measures on subshifts of finite type are nonsingular and ergodic for certain countable equivalence relations, including the orbit relation of the adic transformation (the same as equality after a permutation of…
It is shown that $2\beta_1(\G)\leq h(\G)$ for any countable group $\G$, where $\beta_1(\G)$ is the first $\ell^2$-Betti number and $h(\G)$ the uniform isoperimetric constant. In particular, a countable group with non-vanishing first…
Given pseudo-random binary sequence of length $L$, assuming it consists of $k$ sub-sequences of length $N$. We estimate how $k$ scales with growing $N$ to obtain a {\it limiting} ergodic behaviour, to fulfill the basic definition of…
We examine the degree structure $\mathbf{ER}$ of equivalence relations on $\omega$ under computable reducibility. We examine when pairs of degrees have a join. In particular, we show that sufficiently incomparable pairs of degrees do not…
We prove mean and pointwise ergodic theorems for the action of a discrete lattice subgroup in a connected algebraic Lie group, on infinite volume homogeneous algebraic varieties. Under suitable necessary conditions, our results are…
We consider Delone sets with finite local complexity. We characterize validity of a subadditive ergodic theorem by uniform positivity of certain weights. The latter can be considered to be an averaged version of linear repetitivity. In this…
We develop a robust structure theory for multiple ergodic averages of commuting transformations along Hardy sequences of polynomial growth. We then apply it to derive a number of novel results on joint ergodicity, recurrence and…
We show that for every countable group, any sequence of approximate homomorphisms with values in permutations can be realized as the restriction of a sofic approximation of an orbit equivalence relation. Moreover, this orbit equivalence…