
Markov Chain Monte Carlo, Mixing, and the Spectral Gap
... large to be dealt with all at once. Random walks on very large graphs are an example of this. These sorts of graphs arise in internet-scale applications as representations of web pages or social networks. MCMC schemes that sample uniformly over these graphs are of practical interest to obtain unbias ...
... large to be dealt with all at once. Random walks on very large graphs are an example of this. These sorts of graphs arise in internet-scale applications as representations of web pages or social networks. MCMC schemes that sample uniformly over these graphs are of practical interest to obtain unbias ...