Highly symmetric expanders
Expander graphs are relevant to theoretical computer science in addition to the construction of high-performance switching networks. In communication network applications, a high degree of symmetry in the underlying topology is often advantageous, as it may reduce the complexity of designing and ana...
Saved in:
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/96423 http://hdl.handle.net/10220/9865 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | Expander graphs are relevant to theoretical computer science in addition to the construction of high-performance switching networks. In communication network applications, a high degree of symmetry in the underlying topology is often advantageous, as it may reduce the complexity of designing and analyzing switching and routing algorithms. We give explicit constructions of expander graphs that are highly
symmetric. In particular, we construct in finite families of Ramanujan graphs with large guarantees on the orders of their automorphism groups. Although nonlinear, our expander graphs are within a constant factor of the size of the smallest graphs exhibiting the same expansion properties. This work generalizes and extends in several directions a previous explicit construction of expander graphs based on finite projective spaces due to Alon. |
|---|