Related papers: Amenability, Folner sets, and cooling functions

To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…

We study a uniform, quantitative form of the amenability-hyperfiniteness paradigm for bounded-degree Borel graphs generating countable Borel equivalence relations. We introduce \emph{uniform Borel amenability} and prove that it is…

We consider some computationally efficient and provably correct algorithms with near-optimal sample-complexity for the problem of noisy non-adaptive group testing. Group testing involves grouping arbitrary subsets of items into pools. Each…

We describe conditions that characterize amenability for groups in terms of positive definite functions valued in a von Neumann algebra.

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…

We prove several theorems relating amenability of groups in various categories (discrete, definable, topological, automorphism group) to model-theoretic invariants (quotients by connected components, Lascar Galois group, G-compactness,…

We introduce and study various notions of amenability continuous (Borel) partial actions of locally compact (Borel) groups $G$ on topological (standard Borel) spaces. We also study amenability of partial representations of a locally compact…

Our purpose is to study in the setting of locally compact groupoids the analogues of the well-known equivalent definitions of exactness for discrete groups. Our best results are obtained for a class of \'etale groupoids that we call inner…

We calculate the exact amenability constant of the centre of $\ell^1(G)$ when $G$ is one of the following classes of finite group: dihedral; extraspecial; or Frobenius with abelian complement and kernel. This is done using a formula which…

We extend F{\o}lner's amenability criterion to the realm of general topological groups. Building on this, we show that a topological group $G$ is amenable if and only if its left translation action can be approximated in a uniform manner by…

Formal explainability guarantees the rigor of computed explanations, and so it is paramount in domains where rigor is critical, including those deemed high-risk. Unfortunately, since its inception formal explainability has been hampered by…

Submodular function optimization has numerous applications in machine learning and data analysis, including data summarization which aims to identify a concise and diverse set of data points from a large dataset. It is important to…

We completely characterize connected Lie groups all of whose countable subgroups are weakly amenable. We also provide a characterization of connected semisimple Lie groups that are weakly amenable. Finally, we show that a connected Lie…

We study actions of countable discrete groups which are amenable in the sense that there exists a mean on X which is invariant under the action of G. Assuming that G is nonamenable, we obtain structural results for the stabilizer subgroups…

We define and study notions of amenability and skew-amenability of continuous actions of topological groups on compact topological spaces. Our main motivation is the question under what conditions amenability of a topological group passes…

We show that a large class of i.c.c., countable, discrete groups satisfying a weak negative curvature condition are not inner amenable. By recent work of Hull and Osin, our result recovers that mapping class groups and Out(F_n) are not…

We construct, in locally compact, second countable, amenable groups, sets with large density that fail to have certain combinatorial properties. For the property of being a shift of a set of measurable recurrence we show that this is…

Algorithmic fairness involves expressing notions such as equity, or reasonable treatment, as quantifiable measures that a machine learning algorithm can optimise. Most work in the literature to date has focused on classification problems…

Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…

This text surveys classical and recent results in the field of amenability of groups, from a combinatorial standpoint. It has served as the support of courses at the University of G\"ottingen and the \'Ecole Normale Sup\'erieure. The goals…