Related papers: On amenability of automata groups

The original definition of amenability given by von Neumann in the highly non-constructive terms of means was later recast by Day using approximately invariant probability measures. Moreover, as it was conjectured by Furstenberg and proved…

We give lower bounds for the electrical resistance between vertices in the Schreier graphs of the action of the linear (degree 1) and quadratic (degree 2) mother groups on the orbit of the zero ray. These bounds, combined with results of…

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…

We provide a new characterization of amenability for countable groups, based on frame representations admitting almost invariant vectors. By relaxing the frame inequalities, thereby weakening amenability, we obtain a large class of…

We consider the amenability of groupoids $G$ equipped with a group valued cocycle $c:G\to Q$ with amenable kernel $c^{-1}(e)$. We prove a general result which implies, in particular, that $G$ is amenable whenever $Q$ is amenable and if…

We study a large class of amenable locally compact groups containing all solvable algebraic groups over a local field and their discrete subgroups. We show that the isoperimetric profile of these groups is in some sense optimal among…

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 analyse omega-categorical precompact expansions of particular omega-categorical structures from the viewpoint of amenability of their automorphism groups. The main result of the paper corrects and simplifies Section 3.2 of the first…

This paper will show when a rooted path tree of a finite directed rooted graph has only finitely many orbits under the action of its undirected automorphism group (i.e. when it is cocompact). This will allow us to specify which trees are…

In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…

Mother groups are the basic building blocks for polynomial automaton groups. We show that, in contrast with mother groups of degree 0 or 1, any bounded, symmetric, generating random walk on the mother groups of degree at least 3 has…

We consider automorphism groups of some countably categorical structures and their precompact expansions. We prove that automorphism groups of omega-stable omega-categorical structures have metrizable universal minimal flows. We also study…

We study the portraits of isometries of rooted trees - the labelling of the tree, at each vertex, by the permutation of its descendants - in terms of languages. We characterize regularly branched self-similar groups in terms of…

Suppose $(X,\sigma)$ is a subshift, $P_X(n)$ is the word complexity function of $X$, and ${\rm Aut}(X)$ is the group of automorphisms of $X$. We show that if $P_X(n)=o(n^2/\log^2 n)$, then ${\rm Aut}(X)$ is amenable (as a countable,…

The class A of countable groups that admit a faithful, transitive, amenable -- in the sense that there is an invariant mean -- action on a set has been widely investigated in the past. In this paper, we no longer require the action to be…

We present some partial results concerning a-T-menability of groups acting on trees. Various known results are given uniform proofs.

Inner amenability is a bridge between amenability of an object and amenability of its operator algebras. It is an open problem of Ananantharman-Delaroche to decide whether all \'etale groupoids are inner amenable. Approximate lattices and…

This article explores the interplay between the finite quotients of finitely generated residually finite groups and the concept of amenability. We construct a finitely generated, residually finite, amenable group $A$ and an uncountable…

Let $G\curvearrowright T$ be a minimal action on an $\mathbb{R}$--tree with $G$ finitely presented. Assuming that $G$ is accessible over the family of arc-stabilisers of $T$, we give a description of the point-stabilisers of $T$ in terms of…

A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize such automata in terms of graphs…