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

14 citations · 49 across the 19 of their papers we have counts for

collaborators
Showing 2023 · math.PRShow all

1 paper · 2 filters

math.PR2023

Self-Repellent Random Walks on General Graphs -- Achieving Minimal Sampling Variance via Nonlinear Markov Chains

Vishwaraj Doshi, Jie Hu, Do Young Eun

We consider random walks on discrete state spaces, such as general undirected graphs, where the random walkers are designed to approximate a target quantity over the network topolo…