
TL;DR
This paper demonstrates the existence of a continuum of regular equivalence classes among expander graphs and certain finitely generated groups, using separation profiles to distinguish them.
Contribution
It introduces a method to classify expander graphs and groups via regular equivalence, revealing a vast diversity of such structures.
Findings
There are uncountably many regular equivalence classes of expanders.
A continuum of finitely generated groups contain expanders isometrically.
Separation profiles effectively distinguish these classes.
Abstract
A regular equivalence between two graphs is a pair of uniformly proper Lipschitz maps and . Using separation profiles we prove that there are regular equivalence classes of expander graphs, and of finitely generated groups with a representative which isometrically contains expanders.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
