Stein's method for steady-state diffusion approximation in Wasserstein distance
Abstract
We provide a general steady-state diffusion approximation result which bounds the Wasserstein distance between the reversible measure μ of a diffusion process and the measure of an approximating Markov chain. Our result is obtained thanks to a generalization of a new approach to Stein's method which may be of independent interest. As an application, we study the invariant measure of a random walk on a k-nearest neighbors graph, providing a quantitative answer to a problem of interest to the machine learning community.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.