Before revision:  Prior work proposes Markov Chain Monte Carlo (MCMC) methods that simultaneously sample and generate the graph , eliminating the need for storage .
After revision:  Prior work proposes Markov Chain Monte Carlo (MCMC) methods that use random walks started at some seed vertex and whose equilibrium distribution is the uniform distribution over all edges , eliminating the need for storage .