2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/171897In 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 the complete characterization of the rate of convergence of WoS in terms of the local geomnetry of a domain.ProbabilityClassical Analysis and ODEs60G42, 65C05, 31B25, 31B05The rate of convergence of the Walk on Spheres Algorithmtext