Proving expansion in three steps

  title={Proving expansion in three steps},
  author={Amir Yehudayoff},
  journal={SIGACT News},
This text is meant to be an introduction to a recent strategy introduced by Bourgain and Gamburd (following a work of Helfgott) for proving graph-expansion. The strategy is designed for graphs H that are defined using some underlying group G. The strategy consists of three steps, which, in Sarnak's terminology, correspond to the three steps of a chess game: opening, middle-game and endgame. In the opening, the objective is to prove that the girth of H is logarithmic. In the middle-game, the… 
Lecture 10: Expander Constructions
expander graphs using the notion of spectral gap, and derived a number of interesting properties of expander graphs of low degree. In this lecture, we rst argue that expanders with nontrivial
Popular products and continued fractions
We prove bounds for the popularity of products of sets with weak additive structure, and use these bounds to prove results about continued fractions. Namely, considering Zaremba’s set modulo p , that
Robustness of Bidirectional Interdependent Networks: Analysis and Design
A model for analyzing bidirectional interdependent networks with known topology and defines the metric MR(D) to be the minimum number of nodes that should be removed from one network to cause the failure of D nodes in the other network due to cascading failures to prove that evaluating this metric is not only NP-complete, but also inapproximable.
  • N. Gill
  • Mathematics
    Forum of Mathematics, Sigma
  • 2016
Let $G$ be a finite group acting transitively on a set $\unicode[STIX]{x1D6FA}$ . We study what it means for this action to be quasirandom, thereby generalizing Gowers’ study of quasirandomness in
Mitigating cascading failures in interdependent power grids and communication networks
This work proposes a two-phase control policy to mitigate the cascade of failures and performs a sensitivity analysis to evaluate the performance of the policy, and shows that the control policy achieves close to optimal yield for many scenarios.


Monotone expansion
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, and shows a product-growth theorem for SL2(R); roughly, that for every A ⊂ SL2 (R) with certain properties, the size of AAA is much larger than that of A.
The structure of approximate groups
Let K⩾1 be a parameter. A K-approximate group is a finite set A in a (local) group which contains the identity, is symmetric, and such that A⋅A is covered by K left translates of A.The main result of
Expander Graphs and their Applications
A major consideration we had in writing this survey was to make it accessible to mathematicians as well as to computer scientists, since expander graphs, the protagonists of our story, come up in
Explicit Constructions of Linear-Sized Superconcentrators
Growth in finite simple groups of Lie type of bounded rank
We prove that if L is a finite simple group of Lie type and A a symmetric set of generators of L, then A grows i.e |AAA| > |A|^{1+epsilon} where epsilon depends only on the Lie rank of L, or AAA=L.
The Solovay-Kitaev algorithm
The algorithm can be used to compile Shor's algorithm into an efficient fault-tolerant form using only Hadamard, controlled-not, and π/8 gates, and is generalized to apply to multi-qubit gates and togates from SU(d).
Growth and generation in $\mathrm{SL}_2(\mathbb{Z}/p \mathbb{Z})$
We show that every subset of SL2(Z / pZ) grows rapidly when it acts on itself by the group operation. It follows readily that, for every set of generators A of SL2(Z / pZ), every element of SL2(Z /
The main contribution of this work is a new type of graph product, which we call the {\it zig-zag product}. Taking a product of a large graph with a small graph, the resulting graph inherits
Quasirandom Groups
  • W. T. Gowers
  • Mathematics
    Combinatorics, Probability and Computing
  • 2008
It is shown that there exists a constant c > 0 such that every finite group G has a product-free subset of size at least c|G|: that is, a subset X that does not contain three elements x, y and z with xy = z.
Ramanujan graphs
The girth ofX is asymptotically ≧4/3 logk−1 ¦X¦ which gives larger girth than was previously known by explicit or non-explicit constructions.