activity
20152022
most citedRandom ordering formula for sofic and Rokhlin entropy of Gibbs measures

5 citations · 9 across the 7 of their papers we have counts for

collaborators

9 papers

math.DS2022

The invariant random order extension property is equivalent to amenability

Andrei Alpeev

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.…

math.PR2021★ 1 cited

Examples of measures with trivial left and non-trivial right random walk tail boundary

Andrei Alpeev

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 t…

math.RT2020

Lamplighters over non-amenable groups are not strongly Ulam stable

Andrei Alpeev

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…

math.PR2019

Entropy inequalities and exponential decay of correlations for unique Gibbs measures on trees

Andrei Alpeev

In a recent paper by A. Backhausz, B. Gerencsér and V. Harangi, it was shown that factors of independent identically distributed random processes (IID) on trees obey certain geomet…

math.DS2018★ 1 cited

Predictability, topological entropy and invariant random orders

Andrei Alpeev, Tom Meyerovitch, Sieye Ryu

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 or…

math.DS2018★ 2 cited

Kolmogorov complexity and entropy of amenable group actions

Andrei Alpeev

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 gro…