English

Expander Graphs -- Both Local and Global

Combinatorics 2019-08-29 v3

Abstract

Let G=(V,E)G=(V,E) be a finite graph. For vVv\in V we denote by GvG_v the subgraph of GG that is induced by vv's neighbor set. We say that GG is (a,b)(a,b)-regular for a>b>0a>b>0 integers, if GG is aa-regular and GvG_v is bb-regular for every vVv\in V. Recent advances in PCP theory call for the construction of infinitely many (a,b)(a,b)-regular expander graphs GG that are expanders also locally. Namely, all the graphs {GvvV}\{G_v|v\in V\} should be expanders as well. While random regular graphs are expanders with high probability, they almost surely fail to expand locally. Here we construct two families of (a,b)(a,b)-regular graphs that expand both locally and globally. We also analyze the possible local and global spectral gaps of (a,b)(a,b)-regular graphs. In addition, we examine our constructions vis-a-vis properties which are considered characteristic of high-dimensional expanders.

Keywords

Cite

@article{arxiv.1812.11558,
  title  = {Expander Graphs -- Both Local and Global},
  author = {Michael Chapman and Nati Linial and Yuval Peled},
  journal= {arXiv preprint arXiv:1812.11558},
  year   = {2019}
}

Comments

26 pages, 3 figures

R2 v1 2026-06-23T06:59:12.206Z