arXiv subjects
Publications and source records attributed to Andrei Alpeev.
We characterize $C^*$-simplicity for countable groups by means of the following dichotomy. If a group is $C^*$-simple, then the action on the Poisson boundary is essentially free for a generic measure on the group. If a group is not $C^*$-simple, then the action on the Poisson boundary is not essentially free for a generic measure on the group.
It is a classical result of Kaimanovich and Vershik and independently of Rosenblatt that a non-amenable group admits a non-degenerate symmetric measure such that the Poisson boundary is trivial. Most if not all examples to date of non-free actions of countable groups on their Poisson boundaries had the stabilizers sitting inside the amenable radical. We show that every countable non-C*-simple group admits a symmetric measure of full support with non-trivial stabilizers. For a class of non-C*-simple groups with trivial amenable radical, which is non-empty as was shown by le Boudec, this gives a wealth of examples with non-normal stabilizers.
Recently, Vadim Kaimanovich presented a particular example of a measure on a product of two standard lamplighter groups such that the Poisson boundary of the induced random walk is non-trivial, but the boundary on the marginals is trivial. This was surprising since such behavior is not possible for measures of finite entropy. As we show in this paper, this secret-sharing phenomenon is possible precisely for pairs of amenable groups with non-trivial ICC-factors.
Recently, Glasner, Lin and Meyerovitch gave a first example of a partial invariant order on a certain group that cannot be invariantly extended to an invariant random total order. Using their result as a starting point we prove that any invariant random partial order on a countable group could be invariantly extended to an invariant random total order iff the group is amenable.
In early 80's Vadim Kaimanovich presented a construction of a non-degenerate measure, on the standard lamplighter group, that has a trivial left and non-trivial right random walk tail boundary. We show that examples of such kind are possible precisely for amenable groups that have non-trivial factors with infinite conjugacy classes property.
We prove that a wreath product of an abelian group and a non-amenable group is not strongly Ulam stable. Previously this was known for groups containing free subgroups, due to work of Burger, Ozawa and Thom, and for some surface groups, due to work by Kazhdan. We also show that these wreath products are not deformation rigid.
In a recent paper by A. Backhausz, B. Gerencs\'er and V. Harangi, it was shown that factors of independent identically distributed random processes (IID) on trees obey certain geometry-driven inequalities. In particular, the mutual information shared between two vertices decays exponentially, and there is an explicit bound for this decay. In this note we show that all of these inequalities could be verbatim translated to the setting of factors of processes driven by unique Gibbs measures. As a consequence, we show that correlations decay exponentially for unique Gibbs measures on trees.
We prove that a topologically predictable action of a countable amenable group has zero topological entropy, as conjectured by Hochman. On route, we investigate invariant random orders and formulate a unified Kieffer-Pinsker formula for the Kolmogorov-Sinai entropy of measure preserving actions of amenable groups. We also present a proof due to Weiss for the fact that topologically prime actions of sofic groups have non-positive topological sofic entropy.
It was proved by Brudno that entropy and Kolmogorov complexity for dynamical systems are tightly related. We generalize his results to the case of arbitrary computable amenable group actions. Namely, for an ergodic shift-action, the asymptotic Kolmogorov complexity of a typical point is equal to the Kolmogorov-Sinai entropy of the action. For topological shift actions, the asymptotic Komogorov complexity of every point is bounded from above by the topological entropy, and there is a point attaining this bound.
We show that the class of sofic actions is closed under direct products and contains a (non-unique) maximal element in the weak containment order. For any sofic group we construct nice sofic approximations such that all the sofic actions are approximable by them in a doubly-quenched way. We use recent result by Hayes to establish for these sofic approximations the equality of sofic measure entropy to the topological one for algebraic actions whenever the former is not $-\infty$. We also use his another result to establish the product formula for Pinsker factors of these approximations.
We continue the study of Rokhlin entropy, an isomorphism invariant for probability-measure-preserving actions of countable groups introduced in Part I. In this paper we prove a non-ergodic finite generator theorem and use it to establish sub-additivity and semi-continuity properties of Rokhlin entropy. We also obtain formulas for Rokhlin entropy in terms of ergodic decompositions and inverse limits. Finally, we clarify the relationship between Rokhlin entropy, sofic entropy, and classical Kolmogorov--Sinai entropy. In particular, using Rokhlin entropy we give a new proof of the fact that ergodic actions with positive sofic entropy have finite stabilizers.
We prove the explicit formula for sofic and Rokhlin entropy of actions arising from some class of Gibbs measures. It provides a new set of examples with sofic entropy independent of sofic approximations. It is particularilly interresting, since in non-amenable case Rokhlin entropy was computed only in case of Bernoulli actions and for some examples with zero Rokhlin entropy. As an example we show that our formula holds for the supercritical Ising model. We also establish a criterion for uniqueness of Gibbs measure by means of f-invariant.
In this paper we will prove that any dynamical system posess the unique maximal factor of zero Rokhlin entropy, so-called Pinsker factor. It is proven also, that if the system is ergodic and this factor has no atoms then system is relatively weakly mixing extension of its Pinsker factor.