The Small-Set Expansion problem is the problem of finding sets in a graph that meet specific size and expansion bounds; this problem has received a lot of attention in the past couple of years due to its close relationship with the Unique Games problem. In this talk, I will show how to achieve gap amplification for the Small-Set Expansion problem. Specifically, I will show that an instance of the Small-Set Expansion Problem with completeness ε and soundness 1/2 is at least as difficult as Small-Set Expansion with completeness ϵ and soundness f(ε) for any function f(ε) which grows faster than ε^(1/2). This amplification is achieved via random walks – the gadget is the graph with adjacency matrix corresponding to a random walk on the original graph. An interesting feature of the reduction is that unlike gap amplification via parallel repetition (such as the gap amplification for Unique Games), the size of the instances (number of vertices) produced by the reduction remains the same.