4.4 Article

The rate of convergence of the Walk on Spheres Algorithm

Journal

GEOMETRIC AND FUNCTIONAL ANALYSIS
Volume 22, Issue 3, Pages 558-587

Publisher

SPRINGER BASEL AG
DOI: 10.1007/s00039-012-0161-z

Keywords

Walk on spheres algorithm; harmonic measure; potential theory

Categories

Funding

  1. NSERC Discovery grant

Ask authors/readers for more resources

In this paper we examine the rate of convergence of one of the standard algorithms for emulating exit probabilities of Brownian motion, the Walk on Spheres (WoS) algorithm. We obtain a complete characterization of the rate of convergence of WoS in terms of the local geometry of a domain.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available