
TL;DR
This paper introduces a simple, randomized method for constructing sparse 3-uniform hypergraphs with strong expansion properties using Cayley graphs over rac{Z}_2^t, leading to rapid mixing and uniform edge distribution.
Contribution
It presents a novel construction of hypergraph expanders based on Cayley graphs, with polylogarithmic vertex degree and multiple expansion properties.
Findings
Hypergraphs exhibit strong expansion properties derived from Cayley graphs.
Constructed hypergraphs have polylogarithmic vertex degree.
Hypergraphs demonstrate rapid mixing and uniform edge distribution.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
