Abstract
Let G = (V, E) be a finite graph. For v ∈ V we denote by Gv the subgraph of G that is induced by v’s neighbor set. We say that G is (a,b)-regular for a>b> 0 integers, if G is a-regular and Gv is b-regular for every v ∈ V. Recent advances in PCP theory call for the construction of infinitely many (a,b)-regular expander graphs G that are expanders also locally. Namely, all the graphs {Gv ∣ v ∈ 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)-regular graphs that expand both locally and globally. We also analyze the possible local and global spectral gaps of (a,b)-regular graphs. In addition, we examine our constructions vis-a-vis properties which are considered characteristic of high-dimensional expanders.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Alon, I. Benjamini, E. Lubetzky and S. Sodin: Non-backtracking random walks mix faster, Communications in Contemporary Mathematics9 (2007), 585–603.
L. Babai: Local expansion of vertex-transitive graphs and random generation in finite groups, Proc. 23rd STOC, ACM Press, 164–174, 1991.
B. Bukh: A point in many triangles, Electr. J. Comb., 13(1), 2006.
M. Chapman: Conlon’s construction of hypergraph expanders, available at https://cs.huji.ac.il/~michaelchapman/Lecture_11-6-18JHDE.pdf.
D. Conlon: Hypergraph expanders from Cayley graphs, arXiv:1709.10006, 2017.
G. Davidoff, P. Sarnak and A. Valette: Elementary Number Theory, Group Theory and Ramanujan Graphs, Cambridge university press, 2003.
M. Desai and V. Rao: A characterization of the smallest eigenvalue of a graph, J. Graph Theory18 (1994), 181–194.
I. Dinur and T. Kaufman: High dimensional expanders imply agreement expanders, IEEE 58th Annual Symposium on Foundations of Computer Science, 2017.
S. Evra and T. Kaufman: Bounded degree cosystolic expanders of every dimension, In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016.
H. Garland: p-adic curvature and the cohomology of discrete subgroups of p-adic groups, Annals of Mathematics97 (1973), 375–423.
K. Golubev and O. Parzanchevski: Spectrum and combinatorics of Ramanujan triangle complexes, Israel Journal of Mathematics230 (2019), 583–612.
S. Hoory, N. Linial and A. Wigderson: Expander graphs and their applications, Bull. Amer. Math. Soc.43 (2006), 439–562.
T. Kaufman and D. Mass: High dimensional combinatorial random walks and colorful expansion, CoRR, abs/1604.02947, 2016.
T. Kaufman and I. Oppenheim: Simplicial complexes arising from elementary matrix groups and high dimensional expanders, arXiv:1710.05304, 2017.
N. Linial, A. Magen and A. Naor: Girth and Euclidean distortion, Geometric & Functional Analysis GAFA12 (2002), 380–394.
E. Lubetzky, A. Lubotzky and O. Parzanchevski: Random walks on Ramanujan complexes and digraphs, arXiv:1702.05452, 2017.
A. Lubotzky, B. Samuels and U. Vishne: Ramanujan complexes of type Äd, Israel journal of Mathematics149 (2005), 267–299.
A. W. Marcus, D. A. Spielman and N. Srivastava: Interlacing families I: bipartite Ramanujan graphs of all degrees, Ann. of Math.182 (2015), 307–325.
P. McMullen, C. Schulz and J. M. Wills: Equivelar polyhedral manifolds in e3, Israel J. Math.41 (1982), 331–346.
P. McMullen, C. Schulz and J. M. Wills: Polyhedral 2-manifolds in e3 with unusually large genus, Israel J. Math.46 (1983), 127–144.
I. Oppenheim: Vanishing of cohomology with coefficients in representations on Banach spaces of groups acting on buildings, Comment. Math. Helv.92 (2017), 389–428.
M. Papikian: On Garland’s vanishing theorem for SLn, European Journal of Mathematics2 (2016), 579–613.
J. Radhakrishnan and M. Sudan: On Dinur’s proof of the pcp theorem, Bulletin of th AMS44 (2007), 19–61.
P. Solé: The second eigenvalue of regular graphs of given girth, J. Combin. Theory Ser. B56 (1992), 239–249.
P. M. Weichsel: The Kronecker product of graphs, Proceedings of the American Mathematical Society13 (1962), 47–52.
Acknowledgements
We thank Irit Dinur, whose questions prompted us to work on these problems. Our conversations with Irit took place during a special year on high dimensional combinatorics held in the Israel Institute of Advanced Studies. We thank the IIAS and the organizers of this beautiful year.
Author information
Authors and Affiliations
Corresponding author
Additional information
The second author is supported by ERC grant 339096 “High dimensional combinatorics”.
Rights and permissions
About this article
Cite this article
Chapman, M., Linial, N. & Peled, Y. Expander Graphs — Both Local and Global. Combinatorica 40, 473–509 (2020). https://doi.org/10.1007/s00493-019-4127-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-019-4127-8