Metraipolis › archive › dc_866653aecff3
Efficient Importance Sampling of Brownian Motion Avoiding Poissonian Obstacles for Long Time — arXiv:2610.41234
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41234
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T05:43:29.575Z
- SHA-256 of the archived text
5d2ec7d749848c11d7c49b7c13cc837fae37172847d34dd916a2d83333e1e35a- Stable URL of this page
https://metraipolis.com/documento/dc_866653aecff3
How to cite
Efficient Importance Sampling of Brownian Motion Avoiding Poissonian Obstacles for Long Time — arXiv:2610.41234 — arXiv (en), https://arxiv.org/abs/2610.41234 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_866653aecff3 (Metraipolis archive dc_866653aecff3, sha256 5d2ec7d749848c11d7c49b7c13cc837fae37172847d34dd916a2d83333e1e35a)
BibTeX
@misc{dc866653aecff3,
title = {Efficient Importance Sampling of Brownian Motion Avoiding Poissonian Obstacles for Long Time — arXiv:2610.41234},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41234},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_866653aecff3; sha256 5d2ec7d749848c11d7c49b7c13cc837fae37172847d34dd916a2d83333e1e35a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41234. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We design and analyze an efficient importance sampling estimator of the probability that, over a long time horizon, a Brownian particle avoids obstacles of a fixed radius placed according to an independent Poisson random field. Donsker and Varadhan identify the exponential decay rate of this probability as the optimal balance between the volume cleared of obstacles and the spectral cost of confinement, and the confinement results of Sznitman and Povel show that the particle survives by localizing its path in a ball of (roughly) deterministic radius but with a random center. This strategy makes direct Monte Carlo exponentially ineffective over long horizons, and makes a practical yet asymptotically optimal sampler non-trivial to design, since the sampler must track the random region swept out by the path. For every fixed dimension \(d\ge2\) and every fixed obstacle radius, we construct a sequential importance sampler that is unbiased and asymptotically optimal. The full algorithm has finite expected total work at every fixed horizon, and both its expected work and the coefficient of variation grow at most subexponentially with the time horizon. The method avoids repeatedly solving eigenvalue problems on the evolving explored regions and suits parallel implementation. Numerical experiments illustrate the efficiency of the method. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno). Categorie arXiv: Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2610.41234 — 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-11-03T05:31:46.402Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).