Related papers: Symmetric Groups and Expanders
We prove that if G is SL_2(F) or PSL_2(F), where F is a finite field, and A is a set of generators of G, then either |AAA| > |A|^(1+epsilon), where epsilon is an absolute positive real number, or AAA=G. As a corollary we get that the…
We study the isoperimetric and spectral profiles of certain families of finitely generated groups defined via actions on labelled Schreier graphs and simple {\em gluing} of such. In one of our simplest constructions---the {\em…
We prove that there exist $k\in N$ and $0<\epsilon\in R$ such that every non-abelian finite simple group $G$, which is not a Suzuki group, has a set of $k$ generators for which the Cayley graph $\Cay(G; S)$ is an $\epsilon$-expander.
A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…
FI-graphs were introduced by the second author and White to capture the idea of a family of nested graphs, each member of which is acted on by a progressively larger symmetric group. That work was built on the newly minted foundations of…
We construct small cancellation labellings for some infinite sequences of finite graphs of bounded degree. We use them to define infinite graphical small cancellation presentations of groups. This technique allows us to provide examples of…
The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. Very often the problem is studied for restricted families of graph such as vertex-transitive or…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge…
A "biased expansion" of a graph is a kind of branched covering graph with additional structure related to combinatorial homotopy of circles. Some but not all biased expansions are constructed from groups ("group expansions"); these include…
We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a…
Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural…
It is known that splittings of finitely presented groups over 2-ended groups can be characterized geometrically. We show that this characterization does not extend to all finitely generated groups. Answering a question of Kleiner we show…
Building on recent work of Robertson and Steger, we associate a C*-algebra to a combinatorial object which may be thought of as a higher rank graph. This C*-algebra is shown to be isomorphic to that of the associated path groupoid.…
We prove that uniform Roe C*-algebras associated to some expander graphs coming from discrete groups with property (\tau) are not K-exact. In particular, we show that this is the case for the expander obtained as Cayley graphs of a sequence…
We introduce a construction that gives rise to a variety of "geometric" finite random graphs, and describe connections to the Poisson boundary, Naim's kernel, and Sznitman's random interlacements.
We study a variant of the down-up and up-down walks over an $n$-partite simplicial complex, which we call expanderized higher order random walks -- where the sequence of updated coordinates correspond to the sequence of vertices visited by…
Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$.…
We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…
The cutoff phenomenon describes a sharp transition in the convergence of an ergodic finite Markov chain to equilibrium. Of particular interest is understanding this convergence for the simple random walk on a bounded-degree expander graph.…