Pith. sign in

Walking on Spheres and Talking to Neighbors: Variance Reduction for Laplace's Equation

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it
abstract

Walk on Spheres algorithms leverage properties of Brownian Motion to create Monte Carlo estimates of solutions to a class of elliptic partial differential equations. We propose a new caching strategy which leverages the continuity of paths of Brownian Motion. In the case of Laplace's equation with Dirichlet boundary conditions, our algorithm has improved asymptotic runtime compared to previous approaches. Until recently, estimates were constructed pointwise and did not use the relationship between solutions at nearby points within a domain. Instead, our results are achieved by passing information from a cache of fixed size. We also provide bounds on the performance of our algorithm and demonstrate its performance on example problems of increasing complexity.

citation-role summary

background 2

citation-polarity summary

years

2026 3

verdicts

UNVERDICTED 3

roles

background 2

polarities

background 2

representative citing papers

Randomized quasi-Monte Carlo for walk on spheres

math.NA · 2026-05-08 · unverdicted · novelty 5.0 · 2 refs

RQMC applied to walk-on-spheres for harmonic functions yields median variance decay slightly better than O(n^{-1.1}) and reduction factors 1.8-10.7 across four methods and five examples.

citing papers explorer

Showing 3 of 3 citing papers.