Arrow Research search
Back to STOC

STOC 2012

Monotone expansion

Conference Paper Session 12B Algorithms and Complexity ยท Theoretical Computer Science

Abstract

This work presents an explicit construction of a family of monotone expanders, which are bi-partite expander graphs whose edge-set is defined by (partial) monotone functions. The family is essentially defined by the Mobius action of SL 2 (R), the group of 2 x 2 matrices with determinant one, on the interval [0,1]. No other proof-of-existence for monotone expanders is known, not even using the probabilistic method. The proof extends recent results on finite/compact groups to the non-compact scenario. Specifically, we show a product-growth theorem for SL 2 (R); roughly, that for every A โŠ‚ SL 2 (R) with certain properties, the size of AAA is much larger than that of A. We mention two applications of this construction: Dvir and Shpilka showed that it yields a construction of explicit dimension expanders, which are a generalization of standard expander graphs. Dvir and Wigderson proved that it yields the existence of explicit pushdown expanders, which are graphs that arise in Turing machine simulations.

Authors

Keywords

  • expander graphs
  • explicit constructions

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
504660383159620438
v2026.09.13