Metraipolis › archive › dc_8871671fca1d

Walk-on-Spheres Monte Carlo and deep neural network approximations of elliptic PDEs with drift and killing — arXiv:2608.09494

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.09494
License (as archived)
CC0-1.0
Archived
2026-10-19T09:07:12.094Z
SHA-256 of the archived text
cab7764069987edec8bd1c146e98cccb982f6f38d9779e0463ebb6aa81b2272f
Stable URL of this page
https://metraipolis.com/documento/dc_8871671fca1d

How to cite

Walk-on-Spheres Monte Carlo and deep neural network approximations of elliptic PDEs with drift and killing — arXiv:2608.09494 — arXiv (en), https://arxiv.org/abs/2608.09494 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8871671fca1d (Metraipolis archive dc_8871671fca1d, sha256 cab7764069987edec8bd1c146e98cccb982f6f38d9779e0463ebb6aa81b2272f)
BibTeX
@misc{dc8871671fca1d,
  title = {Walk-on-Spheres Monte Carlo and deep neural network approximations of elliptic PDEs with drift and killing — arXiv:2608.09494},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.09494},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8871671fca1d; sha256 cab7764069987edec8bd1c146e98cccb982f6f38d9779e0463ebb6aa81b2272f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09494. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In this paper we provide Monte Carlo and deep neural network approximations for stochastic representations of solutions to linear elliptic partial differential equations with constant diffusion, drift and killing. Building on the modified Walk-on-Spheres algorithm of Beznea et al. ( arXiv:2209.01432 ), we introduce Monte Carlo estimators that explicitly incorporate sampled random times arising in the analyzed stochastic representations. We establish uniform error bounds for these estimators and show that, under suitable assumptions, a prescribed approximation accuracy is achieved with sample complexities growing at most polynomially in both the inverse accuracy and the problem dimension. Furthermore, we prove a deep neural network approximation result for the stochastic representations. Assuming suitable neural network representations of the boundary data and the distance function to the boundary, we use the constructed Monte Carlo to design deep neural networks that approximate the representation uniformly with a number of parameters growing at most polynomially in the inverse accuracy and the problem dimension. These results extend previous complexity analyses to a broader class of elliptic equations involving drift and killing.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.PR).
Categorie arXiv: Numerical Analysis (math.NA) ; Machine Learning (cs.LG); Analysis of PDEs (math.AP); Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2608.09494 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:04:32.204Z dalla pagina https://arxiv.org/catchup/math.PR/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).