On the expansion of group-based lifts
From MaRDI portal
(Redirected from Publication:5232157)
On the expansion of group-based lifts (scientific article; zbMATH DE number 7099879)
On the expansion of group-based lifts (scientific article; zbMATH DE number 7099879)
Abstract: A -lift of an -vertex base graph is a graph on vertices, where each vertex of is replaced by vertices and each edge in is replaced by a matching representing a bijection so that the edges of are of the form . Lifts have been studied as a means to efficiently construct expanders. In this work, we study lifts obtained from groups and group actions. We derive the spectrum of such lifts via the representation theory principles of the underlying group. Our main results are: (1) There is a constant such that for every , there does not exist an abelian -lift of any -vertex -regular base graph with being almost Ramanujan (nontrivial eigenvalues of the adjacency matrix at most in magnitude). This can be viewed as an analogue of the well-known no-expansion result for abelian Cayley graphs. (2) A uniform random lift in a cyclic group of order of any -vertex -regular base graph , with the nontrivial eigenvalues of the adjacency matrix of bounded by in magnitude, has the new nontrivial eigenvalues also bounded by in magnitude with probability . In particular, there is a constant such that for every , there exists a lift of every Ramanujan graph in a cyclic group of order with being almost Ramanujan. We use this to design a quasi-polynomial time algorithm to construct almost Ramanujan expanders deterministically. The existence of expanding lifts in cyclic groups of order can be viewed as a lower bound on the order of the largest abelian group that produces expanding lifts. Our results show that the lower bound matches the upper bound for (upto in the exponent).
Recommendations
Cites work
- A proof of Alon’s second eigenvalue conjecture and related problems
- Characteristic polynomials of graph coverings
- Characteristic polynomials of some graph coverings
- Diameters and Eigenvalues
- Expander graphs and their applications
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- scientific article; zbMATH DE number 2115090 (Why is no real title available?)
- Lifts, discrepancy and nearly optimal spectral gap
- On the second eigenvalue of a graph
- Ramanujan coverings of graphs
- Ramanujan graphs
- Relative expanders or weakly relatively Ramanujan graphs.
- Shift lifts preserving Ramanujan property
- Spectra of lifted Ramanujan graphs
- Spectral estimates for abelian Cayley graphs
- Word maps and spectra of random graph lifts
Cited in
(8)- \(L^p\)-expander graphs
- Word maps and spectra of random graph lifts
- On the expansion of group-based lifts
- The \(C_3\)-lift on expander graphs
- Spectra of lifted Ramanujan graphs
- Almost-Ramanujan expanders from arbitrary expanders via operator amplification
- Title not available (Why is no real title available?)
- Covers, orientations and factors
This page was built for publication: On the expansion of group-based lifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232157)