Related papers: Uniform Borel Amenability

Almost forty years ago, Connes, Feldman and Weiss proved that for measurable equivalence relations the notions of amenability and hyperfiniteness coincide. In this paper we define the uniform version of amenability and hyperfiniteness for…

We introduce the notions of u-amenability and hyper-u-amenability for countable Borel equivalence relations, strong forms of amenability that are implied by hyperfiniteness. We show that treeable, hyper-u-amenable countable Borel…

Hyperfiniteness or amenability of measurable equivalence relations and group actions has been studied for almost fifty years. Recently, unexpected applications of hyperfiniteness were found in computer science in the context of testability…

We undertake a systematic study of the approximation properties of the topological and measurable versions of the coarse boundary groupoid associated to a sequence of finite graphs of bounded degree. On the topological side, we prove that…

We give new examples and describe the complete lists of all measures on the set of countable homogeneous universal graphs and $K_s$-free homogeneous universal graphs (for $s\geq 3$) that are invariant with respect to the group of all…

We introduce the notion of amenability for affine algebras. We characterize amenability by Folner-sequences, paradoxicality and the existence of finitely invariant dimension-measures. Then we extend the results of Rowen on ranks, from…

In this paper we study unimodular amenable groups. The first part is devoted to results on the existence of uniform families of epsilon-quasi tilings for these groups. In this context, constructions of Ornstein and Weiss are extended by…

We prove a characterization of the amenability of countable Borel equivalence relations in terms of the uniform Liouville property for group actions on their classes. Furthermore, inspired by a well-known amenability criterion for locally…

Let $G$ be an infinite residually finite group. We show that for every minimal equicontinuous Cantor system $(Z,G)$ with a free orbit, and for every minimal extension $(Y,G)$ of $(Z,G)$, there exist a minimal almost 1-1 extension $(X,G)$ of…

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…

Let $\Gamma$ be a countable group acting on a countable set $X$ by permutations. We give a necessary and sufficient condition for the action to have a quasi-invariant mean with a given cocycle. This can be viewed as a combinatorial analogue…

We initiate a quantitative study of measure equivalence (and orbit equivalence) between finitely generated groups, which extends the classical setting of $\mathrm L^p$ measure equivalence. In this paper, our main focus will be on amenable…

Let $(X,\tau)$ be a Polish space with Borel probability measure $\mu,$ and $G$ a locally finite one-ended Borel graph on $X.$ We show that $G$ admits a Borel one-ended spanning tree generically. If $G$ is induced by a free Borel action of…

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

We consider random fields indexed by finite subsets of an amenable discrete group, taking values in the Banach-space of bounded right-continuous functions. The field is assumed to be equivariant, local, coordinate-wise monotone, and almost…

A topological group $G$ is called extremely amenable if every continuous action of $G$ on a compact space has a fixed point. This concept is linked with geometry of high dimensions (concentration of measure). We show that a von Neumann…

A framework to handle tree decompositions of the components of a Borel graph in a Borel fashion is introduced, along the lines of Tserunyan's Stallings Theorem for equivalence relations arXiv:1805.09506. This setting leads to a notion of…

Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…

In 1999, Benjamini, Lyons, Peres, and Schramm introduced a notion of weighted-amenability for transitive graphs that is equivalent to the amenability of its automorphism group. For unimodular graphs this notion coincides with classical…

In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the…