10.1145/acmotherconferencesACM Other Conferences000000010.5555/0000000Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)APPROX/RANDOM 201410.4230/LIPIcs.APPROX-RANDOM.2014.31322Lower Bounds on Expansions of Graph PowersKwokTsz ChiuAuthorLauLap ChiAuthor04092014313324

Given a lazy regular graph G, we prove that the expansion of G^t is at least sqrt(t) times the expansion of G. This bound is tight and can be generalized to small set expansion. We show some applications of this result.