most citedBeyond Random Walk and Metropolis-Hastings Samplers: Why You Should Not Backtrack for Unbiased Graph Sampling

14 citations · 17 across the 3 of their papers we have counts for

collaborators
Showing math.STShow all

1 paper · 1 filter

math.ST2019

Non-Markovian Monte Carlo on Directed Graphs

Chul-Ho Lee, Min Kang, Do Young Eun

Markov Chain Monte Carlo (MCMC) has been the de facto technique for sampling and inference of large graphs such as online social networks. At the heart of MCMC lies the ability to…