The structure of the discrete GFF on any graph is closely related to the behaviour of the simple random walk on the graph. For instance, the discrete GFF plays a key role in the proof by Ding, Lee & Peres (2012) of several conjectures about the cover time of graphs (the expected number of steps it takes for the random walk to visit all the vertices).