Efficient Monte Carlo methods for simulating diffusion-reaction processes in complex systems
Denis Grebenkov

TL;DR
This paper reviews fast random walk algorithms, a Monte Carlo method that efficiently simulates diffusion-reaction processes in complex, heterogeneous systems, enabling detailed probabilistic analysis and PDE solutions.
Contribution
It introduces the principles and applications of FRW algorithms, highlighting their adaptability and efficiency in complex media for simulating diffusion-reaction phenomena.
Findings
FRW algorithms effectively simulate diffusive trajectories in complex media.
They accurately compute probabilistic characteristics like reaction rates and exit times.
FRWs are versatile for solving related PDEs in irregular geometries.
Abstract
We briefly review the principles, mathematical bases, numerical shortcuts and applications of fast random walk (FRW) algorithms. This Monte Carlo technique allows one to simulate individual trajectories of diffusing particles in order to study various probabilistic characteristics (harmonic measure, first passage/exit time distribution, reaction rates, search times and strategies, etc.) and to solve the related partial differential equations. The adaptive character and flexibility of FRWs make them particularly efficient for simulating diffusive processes in porous, multiscale, heterogeneous, disordered or irregularly-shaped media.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDiffusion and Search Dynamics · Theoretical and Computational Physics
