Random Schreier graphs and expanders

From MaRDI portal



Abstract: Let the group G act transitively on the finite set Omega, and let SsubseteqG be closed under taking inverses. The Schreier graph Sch(GcirclearrowleftOmega,S) is the graph with vertex set Omega and edge set (omega,omegas):omegainOmega,sinS. In this paper, we show that random Schreier graphs on Clog|Omega| elements exhibit a (two-sided) spectral gap with high probability, magnifying a well known theorem of Alon and Roichman for Cayley graphs. On the other hand, depending on the particular action of G on Omega, we give a lower bound on the number of elements which are necessary to provide a spectral gap. We use this method to estimate the spectral gap when G is nilpotent.





Describes a project that uses

Uses Software






This page was built for publication: Random Schreier graphs and expanders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2082534)