Related papers: Amenability, Folner sets, and cooling functions
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…
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…
We introduce a new combinatorial condition that characterises the amenability for locally compact groups. Our condition is weaker than the well-known F{\o}lner's conditions, and so is potentially useful as a criteria to show the amenability…
We show that the amenability of a locally compact group $G$ is equivalent to a factorization property of $VN(G)$ which is given by $ VN(G) = <VN(G)^*VN(G)>$. This answer partially two problems proposed by Z. Hu and M. Neufang in their…
We study the problem of explainability-first clustering where explainability becomes a first-class citizen for clustering. Previous clustering approaches use decision trees for explanation, but only after the clustering is completed. In…
We show that the universal minimimal proximal flow and the universal minimal strongly proximal flow of a discrete group can be realized as the Stone spaces of translation invariant Boolean algebras of subsets of the group satisfying a…
We give a short geometric proof of a result of Soardi & Woess and Salvatori that a quasitransitive graph is amenable if and only if its automorphism group is amenable and unimodular. We also strengthen one direction of that result by…
We define a notion of relative soficity for countable groups with respect to a family of groups. A group is sofic if and only if it is relative sofic with respect to the family consisting only of the trivial group. If a group is relatively…
Neural networks achieve outstanding accuracy in classification and regression tasks. However, understanding their behavior still remains an open challenge that requires questions to be addressed on the robustness, explainability and…
It is well known that if $G$ is a countable amenable group and $G \curvearrowright (Y, \nu)$ factors onto $G \curvearrowright (X, \mu)$, then the entropy of the first action must be greater than or equal to the entropy of the second action.…
We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability…
We prove that for any infinite countable amenable group $G$, any $\epsilon > 0$ and any finite subset $K\subset G$, there exists a tiling (partition of $G$ into finite "tiles" using only finitely many "shapes"), where all the tiles are $(K;…
In this paper, we study several finite approximation properties of topological full groups of group actions on the Cantor set such that free points are dense. Firstly, we establish that for such a distal action $\alpha$ of a countable…
We give the first examples of (non-amenable group) amenable actions on stably finite simple C*-algebras. More precisely, we give such actions for any countable group in an explicit way. The main ingredients of our construction are the full…
We introduce the notion of first order amenability, as a property of a first order theory $T$: every complete type over $\emptyset$, in possibly infinitely many variables, extends to an automorphism-invariant global Keisler measure in the…
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…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
Amenable category is a variant of the Lusternik-Schnirelman category, based on covers by amenable open subsets. We study the monotonicity problem for degree-one maps and amenable category and the relation between amenable category and…
We develop in this paper some general techniques to analyze action sets of small doubling for probability measure-preserving actions of amenable groups. As an application of these techniques, we prove a dynamical generalization of Kneser's…
We give a combinatorial characterization of amenability of monomial algebras and prove the existence of monomial Folner sequences, answering a question due to Ceccherini-Silberstein and Samet-Vaillant. We then use our characterization to…