Abstract
We describe a short and easy to analyze construction of constant-degree expanders. The construction relies on the replacement product, applied by [14] to give an iterative construction of bounded-degree expanders. Here we give a simpler construction, which applies the replacement product (only twice!) to turn the Cayley expanders of [4], whose degree is polylog n, into constant degree expanders. This enables us to prove the required expansion using a new simple combinatorial analysis of the replacement product (instead of the spectral analysis used in [14]).
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 |
| Publisher | Association for Computing Machinery |
| Pages | 454-458 |
| Number of pages | 5 |
| ISBN (Electronic) | 9780898716245 |
| State | Published - 2007 |
| Externally published | Yes |
| Event | 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 - New Orleans, United States Duration: 7 Jan 2007 → 9 Jan 2007 |
Publication series
| Name | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| Volume | 07-09-January-2007 |
Conference
| Conference | 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 |
|---|---|
| Country/Territory | United States |
| City | New Orleans |
| Period | 7/01/07 → 9/01/07 |
Bibliographical note
Publisher Copyright:Copyright © 2007 by the Association for Computing Machinery, Inc. and the Society for Industrial and Applied Mathematics.