575 research outputs found
Hypergraph expanders from Cayley graphs
We present a simple mechanism, which can be randomised, for constructing
sparse -uniform hypergraphs with strong expansion properties. These
hypergraphs are constructed using Cayley graphs over and have
vertex degree which is polylogarithmic in the number of vertices. Their
expansion properties, which are derived from the underlying Cayley graphs,
include analogues of vertex and edge expansion in graphs, rapid mixing of the
random walk on the edges of the skeleton graph, uniform distribution of edges
on large vertex subsets and the geometric overlap property.Comment: 13 page
- …