Conformal First Passage for Epsilon-free Walk-on-Spheres
Paul Himmler, Tobias Günther
Abstract
In recent years, grid-free Monte Carlo methods have gained increasing popularity for solving fundamental partial differential equations. For a given point in the domain, the Walk-on-Spheres method solves a boundary integral equation by integrating recursively over the largest possible sphere. When the walks approach boundaries with Dirichlet conditions, the number of path vertices increases considerably, since the step size becomes smaller with decreasing distance to the boundary. In practice, the walks are terminated once they reach an epsilon-shell around the boundary. This, however, introduces bias, leading to a trade-off between accuracy and performance. Instead of using spheres, we propose to utilize geometric primitives that share more than one point with the boundary to increase the likelihood of immediately terminating. Along the boundary of those new geometric primitives a sampling probability is needed, which corresponds to the exit probability of a Brownian motion. This is known as a first passage problem. Utilizing that Laplace equations are invariant under conformal maps, we transform exit points from unit circles to the exit points of our geometric primitives, for which we describe a suitable placement strategy. With this, we obtain a novel approach to solve the Laplace equation in two dimensions, which does not require an epsilon-shell, significantly reduces the number of path vertices, and reduces inaccuracies near Dirichlet boundaries.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on10
- Monte Carlo geometry processing: a grid-free approach to PDE-based methods on volumetric domainsRohan Sawhney, Keenan CraneSIGGRAPH 2020 · 99 citations
- Walk on Stars: A Grid-Free Monte Carlo Method for PDEs with Neumann Boundary ConditionsRohan Sawhney, Bailey Miller, Ioannis Gkioulekas, Keenan CraneSIGGRAPH 2023 · 48 citations
- A Practical Walk-on-Boundary Method for Boundary Value ProblemsRyusuke Sugimoto, Terry Chen, Yiti Jiang, Christopher Batty et al.SIGGRAPH 2023 · 42 citations
- Boundary Value Caching for Walk on SpheresBailey Miller, Rohan Sawhney, Keenan Crane, Ioannis GkioulekasSIGGRAPH 2023 · 34 citations
- Kelvin transformations for simulations on infinite domainsMohammad Sina Nabizadeh, Ravi Ramamoorthi, Albert ChernSIGGRAPH 2021 · 34 citations
Related papers
- Walking on Spheres and Talking to Neighbors: Variance Reduction for Laplace's EquationMichael Czekanski, Benjamin Faber, Margaret Fairborn, Adelle Wright et al.SIGGRAPH 2026 · 1 citation
- Walkin' Robin: Walk on Stars with Robin Boundary ConditionsBailey Miller, Rohan Sawhney, Keenan Crane, Ioannis GkioulekasSIGGRAPH 2024 · 30 citations
- A Differential Monte Carlo Solver For the Poisson EquationZihan Yu, Lifan Wu, Zhiqian Zhou, Shuang ZhaoSIGGRAPH 2024 · 19 citations
- Walk on Decomposed Subdomains: A Hybrid Monte Carlo-Deterministic Solver for Elliptic PDEsClément Jambon, Mohammad Sina Nabizadeh, Mina Konakovic-LukovicSIGGRAPH 2026
- Probe-based Walk on Spheres for Efficient Path ReusingWanchao Huang, Yutian Zhu, Qing Fang, Ligang LiuSIGGRAPH 2026
