TY - GEN
T1 - Monotone expansion
AU - Bourgain, Jean
AU - Yehudayoff, Amir
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
KW - expander graphs
KW - explicit constructions
UR - http://www.scopus.com/inward/record.url?scp=84862620913&partnerID=8YFLogxK
U2 - 10.1145/2213977.2214073
DO - 10.1145/2213977.2214073
M3 - منشور من مؤتمر
SN - 9781450312455
T3 - Proceedings of the Annual ACM Symposium on Theory of Computing
SP - 1061
EP - 1078
BT - STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing
T2 - 44th Annual ACM Symposium on Theory of Computing, STOC '12
Y2 - 19 May 2012 through 22 May 2012
ER -