Related papers: Groups that produce expander graphs

Differential operators of Schrodinger type are considered on metric Cayley graphs of free groups with a minimal set of M generators. The potential and edge lengths may vary with the M edge types. Using novel methods, a set of M multipliers…

The problem of constructing or characterizing strongly regular Cayley graphs (or equivalently, regular partial difference sets) has garnered significant attention over the past half-century. In 2003, Miklavi\v{c} and Poto\v{c}nik [European…

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…

We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…

We prove that thick groups (and more generally thick graphs) have trivial Floyd boundary. This shows a wide class of finitely generated groups that are non-relatively hyperbolic have trivial Floyd boundary. In addition to giving new…

We prove that every Schreier graph of a free Borel action of a finitely generated non-amenable group has a Baire measurable perfect matching. This result was previously only known in the bipartite setting. We also prove that every Borel…

The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations…

We study commensurating actions of groups and the associated properties FW and PW, in connection with wallings, median graphs, CAT(0) cubings and multi-ended Schreier graphs.

This paper completely determines the non-amenability of the mapping class groups of infinite-type surfaces, the mapping class groups of locally finite infinite graphs of higher ranks, gives an example of non-amenable stabiliser of a point…

We investigate groups whose Cayley graphs have poor\-ly connected subgraphs. We prove that a finitely generated group has bounded separation in the sense of Benjamini--Schramm--Tim\'ar if and only if it is virtually free. We then prove a…

The goal of this article is to study results and examples concerning finitely presented covers of finitely generated amenable groups. We collect examples of groups $G$ with the following properties: (i) $G$ is finitely generated, (ii) $G$…

The critical group of a finite graph is an abelian group defined by the Smith normal form of the Laplacian. We determine the the critical groups of the Peisert graphs, a certain family of strongly regular graphs similar to, but different…

We study profinite actions of residually finite groups in terms of weak containment. We show that two strongly ergodic profinite actions of a group are weakly equivalent if and only if they are isomorphic. This allows us to construct…

We introduce a notion of Ricci curvature for Cayley graphs that can be thought of as "medium-scale" because it is neither infinitesimal nor asymptotic, but based on a chosen finite radius parameter. We argue that it gives the foundation for…

Let S be a fixed finite symmetric subset of SL_d(Z), and assume that it generates a Zariski-dense subgroup G. We show that the Cayley graphs of pi_q(G) with respect to the generating set pi_q(S) form a family of expanders, where pi_q is the…

We study permanence results for almost quasi-isometries, the maps arising from the Gromov construction of finitely generated random groups that contain expanders (and hence that are not C*-exact). We show that the image of a sequence of…

The connective constant $\mu(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. The relationship between connective constants and amenability is explored in the…

Let $G$ be a finite group. It was remarked by Breuillard-Green-Guralnick-Tao that if the Cayley graph $C(G,S)$ is an expander graph and is non-bipartite then the spectrum of the adjacency operator $T$ is bounded away from $-1$. In this…

If $G$ is a group and $S$ a generating set, $G$ canonically embeds into the automorphism group of its Cayley graph and it is natural to try to minimize, over all generating sets, the index of this inclusion. This infimum is called the…

Barbieri recently showed that the finite graphs realising any given finite automorphism group have unbounded genus, answering a question of Cornwell et al. In this note we give a short proof of a stronger result: they have unbounded clique…