Monotone expansion

Jean Bourgain, Amir Yehudayoff

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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(ℝ), 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(ℝ); roughly, that for every A ⊂ SL 2(ℝ) 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.

Original languageEnglish
Title of host publicationSTOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing
Pages1061-1078
Number of pages18
DOIs
StatePublished - 2012
Event44th Annual ACM Symposium on Theory of Computing, STOC '12 - New York, NY, United States
Duration: 19 May 201222 May 2012

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing

Conference

Conference44th Annual ACM Symposium on Theory of Computing, STOC '12
Country/TerritoryUnited States
CityNew York, NY
Period19/05/1222/05/12

Keywords

  • expander graphs
  • explicit constructions

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'Monotone expansion'. Together they form a unique fingerprint.

Cite this