Edge-reinforced random walk (ERRW), introduced by Coppersmith and Diaconis in 1986 [8], is a random process which takes values in the vertex set of a graph $G$ and is more likely to cross edges it has visited before. We show that it can be represented in terms of a vertex-reinforced jump process (VRJP) with independent gamma conductances; the VRJP was conceived by Werner and first studied by Davis and Volkov [10, 11], and is a continuous-time process favouring sites with more local time. We calculate,...