Using the technique of evolving sets, we explore the connection between entropy growth and transience for simple random walks on connected infinite graphs with bounded degree. In particular we show that for a simple random walk starting at a vertex x(0), if the entropy after n steps, E-n is at least Cn where the C is independent of x0, then the random walk is transient. We also give an example which demonstrates that the condition of C being independent of x(0) is necessary.