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