Lower Bounds on Expansions of Graph Powers
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.
Conductance
Expansion
Graph power
Random walk
313-324
Regular Paper
Tsz Chiu
Kwok
Tsz Chiu Kwok
Lap Chi
Lau
Lap Chi Lau
10.4230/LIPIcs.APPROX-RANDOM.2014.313
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode