betaFeedback

WorksPhysics and Astronomy

Escape-from-a-layer approach for simulating the boundary local time in Euclidean domains

Abstract

We propose an efficient numerical approach to simulate the boundary local time of reflected Brownian motion, as well as the time and position of the associated reaction event on a smooth boundary of a Euclidean domain. This approach combines the standard walk-on-spheres algorithm in the bulk with the approximate solution of the escape problem in a boundary layer. In this way, the most time-consuming simulation of multiple reflections on the boundary is replaced by an equivalent escape event. We validate the proposed escape-from-a-layer approach by comparing simulated statistics of the boundary local time with exact results known for simple domains (a disk, a circular annulus, a sphere, a spherical shell) and with the numerical results obtained by a finite-element method in more sophisticated domains. This approach offers a powerful tool for simulating reflected Brownian motion in multi-scale confinements such as porous media or biological environments, and for solving the related partial differential equations. Its applications in the context of diffusion-controlled reactions in chemical physics are discussed.

Introduction

The boundary local time ℓt\ell_t plays the central role in the theory of stochastic processes [1–3]. For instance, reflected Brownian motion XtX_t inside a given Euclidean domain Ω⊂Rd\Omega\subset\mathbb{R}^{d} with a smooth boundary ∂Ω\partial\Omega can be constructed as the solution of the Skorokhod stochastic equation [2, 3]

dXt=2D dWt+n(Xt) dℓt,X0=x0,ℓ0=0,(1)\mathrm{d}X_t = \sqrt{2D}\,\mathrm{d}W_t + \boldsymbol{n}(X_t)\,\mathrm{d}\ell_t,\qquad X_0=x_0,\qquad\ell_0=0, \tag*{(1)}

where WtW_t is the standard Wiener process in Rd\mathbb{R}^{d}, DD is the diffusion coefficient, x0∈Ωx_0 \in\Omega is the starting point, n(x)\boldsymbol{n}(x) is the unit normal vector at a boundary point x∈∂Ωx \in\partial\Omega oriented inward the domain Ω\Omega, and ℓt\ell_t is a nondecreasing stochastic process that increments at each encounter of XtX_t with the boundary. Qualitatively, the first term in Eq. (1) describes ordinary Brownian motion inside Ω\Omega, whereas the second term ensures that XtX_t is reflected back normally into Ω\Omega at each encounter with the boundary. From the physical point of view, one can think of the second term as an infinitely local force field that pushes the diffusing particle back to the confining domain [4]. Curiously, the single stochastic equation (1) determines simultaneously two tightly related stochastic processes: the position XtX_t and the boundary local time ℓt\ell_t (which has, despite its name, units of length). The latter should not be confused with a point local time, which represents the residence time of Brownian motion in a vicinity of a bulk point (see [5–7]). Note that the boundary local time can be expressed as

ℓt=lim⁡ε→0Dε∫0tdt′ Θ(ε−∣Xt′−∂Ω∣),(2)\ell_t = \lim_{\varepsilon\to0} \frac{D}{\varepsilon}\int_0^t \mathrm{d}t'\,\Theta(\varepsilon-\lvert X_{t'}-\partial\Omega\rvert), \tag*{(2)}

where ∣x−∂Ω∣\lvert x-\partial\Omega\rvert is the Euclidean distance between a point xx and the boundary ∂Ω\partial\Omega, and Θ(z)\Theta(z) is the Heaviside step function: Θ(z)=1\Theta(z)=1 for z>0z>0 and 0 otherwise. The integral represents the residence time of the process XtX_t in a thin layer ∂Ωε={x∈Ω:∣x−∂Ω∣<ε}\partial\Omega_\varepsilon= \{x \in\Omega: |x - \partial\Omega| < \varepsilon\} of width ε\varepsilon near the boundary ∂Ω\partial\Omega, which is rescaled by ε\varepsilon to get a nontrivial limit, as ε→0\varepsilon\to0. Alternatively, one has

ℓt=lim⁡ε→0εNt(ε),(3)\ell_t = \lim_{\varepsilon\to0} \varepsilon\mathcal{N}_t^{(\varepsilon)}, \tag*{(3)}

where Nt(ε)\mathcal{N}_t^{(\varepsilon)} is the number of crossings of the layer ∂Ωε\partial\Omega_\varepsilon up to time tt. In other words, the boundary local time ℓt\ell_t can be understood either as the rescaled residence time in a thin boundary layer, or as the rescaled number of encounters with that boundary.

Apart from its major role in the theory of stochastic processes, the boundary local time was recently employed as the conceptual pillar to build the encounter-based approach to diffusion-controlled reactions [4]. This approach laid a theoretical ground for assessing the statistics of encounters between the diffusing particle and the boundary, provided an intuitively clear probabilistic interpretation of partial reactivity and allowed one to consider much more general surface reaction mechanisms [8, 9, 10, 11, 12, 13, 14, 15]. In fact, the reaction event of a diffusing particle on the boundary can be initiated when the boundary local time ℓt\ell_t exceeds a chosen random threshold ℓ^\hat{\ell}. In this way, the probability distribution of the threshold determines the surface reaction mechanism independently of the diffusive dynamics. So, the exponential distribution of ℓ^\hat{\ell} corresponds to the standard constant reactivity implemented via Robin boundary condition, whereas other distributions can describe, for instance, progressive activation or passivation of the boundary by the diffusing particle [15, 16]. While the former setting can be simulated by conventional methods, implementation of more sophisticated surface reaction mechanisms requires the knowledge of the boundary local time. Moreover, these concepts were further extended to describe permeation across membranes [17, 18, 19], diffusive exchange between adjacent compartments [20], and the related snapping out Brownian motion [21, 22].

Despite these advances, the fundamental relation between the statistics of the boundary local time ℓt\ell_t and the geometrical structure of the confining domain Ω\Omega remains poorly understood. For instance, the distribution of ℓt\ell_t is known explicitly only for two simple domains: a half-line and the exterior of a sphere [8, 23, 24]. Indeed, the symmetries of these domains allow for the separation of variables and thus reduction to a one-dimensional problem that can be solved exactly. In contrast, most diffusive processes in nature and industrial applications occur in multi-scale media with irregular, sophisticated boundaries, for which numerical tools are needed to access the statistics of encounters. Even though the spectral expansions developed in [4] are formally still applicable in such domains, their numerical implementation (e.g., by a finite-element method) can be very costly and time-consuming, especially in three dimensions. In this light, one may prefer Monte Carlo techniques that offer great flexibility and moderate computational costs [25, 26, 27]. While these techniques are broadly used for simulating stochastic processes and diffusion-controlled reactions in complex domains [28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50], their adaptation for studying the boundary local time is not straightforward.

The most basic way to simulate the boundary local time consists in approximating reflected Brownian motion by a random walk on a lattice with spacing ε\varepsilon and counting the number Nt(ε)\mathcal{N}_t^{(\varepsilon)} of its encounters with the discretized boundary ∂Ω\partial\Omega. According to Eq. (3), εNt(ε)\varepsilon\mathcal{N}_t^{(\varepsilon)} is an approximation of ℓt\ell_t, if ε\varepsilon is small enough. The need for boundary discretization and excessively long trajectories (with 2dΔt/ε22d\Delta t/\varepsilon^2 steps) are major drawbacks of this method. The first drawback can be relaxed by performing off-lattice random walks, i.e., a sequence of centered Gaussian jumps of variance σ2\sigma^2 with normal reflections on the boundary. In this case, one can either count the number Nt(σ)\mathcal{N}_t^{(\sigma)} of reflections and use again Eq. (3) with σ\sigma instead of ε\varepsilon, or calculate the residence time of this random walk inside a boundary layer of width ε∼σ\varepsilon\sim\sigma and use Eq. (2) to approximate ℓt\ell_t (see also [51] for the discussion of Euler schemes). Since a typical one-jump displacement σ\sigma should be the smallest length scale of the problem, this method can be efficient for simple domains (see, e.g., [52]) but it becomes too time-consuming in multi-scale media. This issue was partly resolved by Zhou et al. who combined the standard walk-on-spheres (WOS) algorithm by Muller [53] and the fixed-length displacements in a thin layer near boundary [54]. Their hybrid method exploits the well-known advantages of the WOS algorithm for fast simulations of large-scale displacements far from the boundary (see details in § 2.1). As a consequence, the major remaining computational limitation is caused by modeling small displacements inside the boundary layer of small width ε\varepsilon. This method was further improved and adopted to simulating snapping out Brownian motion in planar bounded domains by Schumm and Bressloff [55]. In particular, they suggested using walk-on-spheres even inside the boundary layer of width ε\varepsilon, with the jump distance being fixed to be 2ε2\varepsilon, in order to speed up simulations within that layer. Despite this progress, an accurate estimation of the boundary local time ℓt\ell_t within a boundary layer requires taking ε\varepsilon sufficient small so that modeling of reflected Brownian motion within this layer remains the critical bottleneck of these multi-scale Monte Carlo simulations.

In this paper, we propose a different approach to simulate the stochastic process (Xt,ℓt)(X_t, \ell_t) inside a confining domain. We still employ the WOS algorithm for fast simulations of large-scale displacements far from the boundary. In turn, we replace the detailed time-consuming simulation of the stochastic process within a boundary layer by a single escape event from that layer. A similar approach was recently implemented for simulating the escape of a sticky particle [56, 57]. In fact, once the process arrives inside the layer, we introduce the random escape time τ\tau from that layer, i.e., the first-passage time to the set Γε={x∈Ω:∣x−∂Ω∣=ε}\Gamma_{\varepsilon}=\{x\in\Omega:|x-\partial\Omega|=\varepsilon\} of points in Ω\Omega that are equidistant to the boundary (Figure 1a).

Image not extracted

Figure 1. (a) A zoom near the boundary ∂Ω\partial\Omega: once the WOS arrives inside the boundary layer ∂Ωε\partial\Omega_{\varepsilon} of width ε\varepsilon, one aims at replacing a costly detailed simulation of the random trajectory (in green) from the entrance point xkx_k to the exit point xk+1x_{k+1} by a single escape event. For this purpose, one needs to generate the escape position xk+1x_{k+1}, the escape time τ\tau, and the acquired boundary local time ℓτ′\ell_{\tau}^{\prime}. (b) Flat layer approximation: starting from a point (0,y0)(0,y_0) (yellow circle), a random trajectory (in blue) experiences numerous reflections on the flat boundary before escaping an infinite stripe of width ε\varepsilon at a random escape time τ\tau in a random escape position (xτ,ε)(x_{\tau},\varepsilon) (red circle). These reflections are characterized by the acquired boundary local time ℓτ′\ell_{\tau}^{\prime}. The random trajectory is thus replaced by a simple jump from (0,y0)(0,y_0) to (xτ,ε)(x_{\tau},\varepsilon).

To realize an escape event, the central quantity of interest is the joint probability density of the escape time τ\tau, the escape position XτX_{\tau}, and the acquired boundary local time ℓτ\ell_{\tau}. Its exact spectral expansion was recently derived by means of the encounter-based approach [58]. As a smooth boundary is locally flat, the spectral expansion takes a simple form that allows its direct implementation in Monte Carlo simulations. Moreover, when the boundary is composed of flat elements, the simulation of the escape event becomes almost exact. In addition, we propose an improvement to account for the curvature of the boundary in order to enable using a larger width ε\varepsilon of the boundary layer. In this way, there is no need for simulating multiple reflections on the boundary that was the most time-consuming step and the main source of accumulating errors in former techniques.

The paper is organized as follows. In § 2, we describe the escape-from-a-layer (EFL) approach. We start with a simpler approximation of a flat boundary layer and then discuss its improvement to curved boundary layers. § 3 summarizes an algorithmic implementation of the EFL approach. § 4 validates this method for several confining domains by comparing simulated results to either exact values, or numerical values obtained by a finite-element method. We also compare the performance of our method to the state-of-the-art method by Schumm and Bressloff [55]. In § 5, we discuss further improvements, extensions, applications and future perspectives of this method.

Escape-from-a-layer approach

Walk-on-spheres algorithm

We start by recalling the walk-on-spheres algorithm for simulating Brownian motion in a confining domain Ω⊂Rd\Omega\subset\mathbb{R}^{d} with an absorbing boundary ∂Ω\partial\Omega [53]. From a prescribed starting point x0∈Ωx_0\in\Omega, one determines the Euclidean distance ρ0=∣x0−∂Ω∣\rho_0=|x_0-\partial\Omega| to the boundary ∂Ω\partial\Omega and draws a ball Bρ0(x0)B_{\rho_0}(x_0) of radius ρ0\rho_0 centered at x0x_0. The continuity of Brownian motion implies that any trajectory must cross the boundary of this ball, ∂Bρ0(x0)\partial B_{\rho_0}(x_0), before hitting the boundary ∂Ω\partial\Omega. One can therefore replace lengthy simulations of the trajectory inside the ball by an escape event, i.e., a jump to a uniformly distributed point x1x_1 on ∂Bρ0(x0)\partial B_{\rho_0}(x_0). The probability distribution of the time τ1\tau_1 needed to escape from the ball is known explicitly (see Appendix § 7) that allows one to easily generate the random variable τ1\tau_1. From the x1x_1, the previous step is repeated, i.e., one determines the distance ρ1=∣x1−∂Ω∣\rho_1 = |x_1 - \partial\Omega| and generates the escape time τ2\tau_2 and the escape position x2x_2 as a uniformly distributed point on the sphere ∂Bρ1(x1)\partial B_{\rho_1}(x_1), and so on. The algorithm is stopped when the distance to the boundary becomes smaller than a prescribed threshold ε\varepsilon. This procedure samples a sequence of points Xt1,Xt2,…,XtkX_{t_1}, X_{t_2}, \ldots, X_{t_k} of a random trajectory XtX_t at random times t1=τ1t_1 = \tau_1, t2=t1+τ2,…,tk=tk−1+τkt_2 = t_1 + \tau_2, \ldots, t_k = t_{k-1} + \tau_k. As the jump length is progressively adapted according to the proximity to the boundary, large jumps can be performed far from the boundary. This variability ensures remarkably fast convergence of the method [59] and allows for efficient simulations of Brownian motion in multi-scale environments [29, 30, 31, 32, 35, 36, 37, 38].

The threshold ε\varepsilon determines the width of a boundary layer, which is considered as absorbing: the process is stopped once it arrives to this layer. The value of ε\varepsilon can be either assigned from the underlying microscopic model (e.g., the interaction range between the diffusing particle and the boundary), or treated as a numerical parameter of the method. As shown by Binder and Braverman [59], the computational time scales linearly with ln⁡(1/ε)\ln(1/\varepsilon), i.e., one can choose an extremely small ε\varepsilon with almost no computational cost. This remarkably fast convergence explains the efficiency and popularity of the WOS algorithm in domains with absorbing boundaries. However, if the boundary is not absorbing, one loses such fast convergence. Indeed, if the process is not stopped upon the first arrival into the boundary layer, one needs to simulate reflections on the boundary that forms the critical bottleneck for an extension of the WOS method to reflecting boundaries. In the next subsections, we propose an efficient way to solve this problem.

The layer escape problem

References

  1. [8]D. S. Grebenkov, Statistics of boundary encounters by a particle diffusing outside a compact planar domain, J. Phys. A: Math. Theor. 54, 015003 (2021).DOI
  2. [9]D. S. Grebenkov, An encounter-based approach for restricted diffusion with a gradient drift, J. Phys. A: Math. Theor. 55, 045203 (2022).DOI
  3. [10]P. C. Bressloff, Narrow capture problem: An encounter-based approach to partially reactive targets, Phys. Rev. E 105, 034141 (2022).DOI
  4. [11]D. S. Grebenkov, Statistics of diffusive encounters with a small target: Three complementary approaches, J. Stat. Mech. 083205 (2022).DOI
  5. [12]P. C. Bressloff, Diffusion-mediated surface reactions and stochastic resetting, J. Phys. A: Math. Theor. 55, 275002 (2022).DOI
  6. [13]Z. Benkakdaji and D. S. Grebenkov, Encounter-based approach to diffusion with resetting, Phys. Rev. E 106, 044121 (2022).
  7. [14]D. S. Grebenkov, Depletion of Resources by a Population of Diffusing Species, Phys. Rev. E 105, 054402 (2022).DOI
  8. [15]D. S. Grebenkov, Diffusion-controlled reactions with non-Markovian binding/unbinding kinetics, J. Chem. Phys. 158, 214111 (2023).arxiv.org/abs/2310.01106
  9. [16]D. S. Grebenkov, Adsorption and permeation events in molecular diffusion, Molecules 29, 5012 (2024).DOI
  10. [17]P. C. Bressloff, A probabilistic model of diffusion through a semipermeable barrier, Proc. Roy. Soc. A 478, 20220615 (2022).DOI
  11. [18]P. C. Bressloff, Renewal equation for single-particle diffusion through a semipermeable interface, Phys. Rev. E 107, 014110 (2023).DOI
  12. [19]P. C. Bressloff, Renewal equations for single-particle diffusion in multilayered media, SIAM J. Appl. Math. 83, 1518–1545 (2023).arxiv.org/abs/2301.02895
  13. [20]E. Fieremans, D. S. Novikov, J. H. Jensen, and J. A. Helpern, Monte Carlo study of a two-compartment exchange model of diffusion, NMR Biomed. 23, 711-724 (2010).DOI
  14. [21]A. Lejay, The snapping out Brownian motion, Ann. Appl. Probab. 26, 1727-1742 (2016).DOI
  15. [22]A. Lejay, Monte Carlo estimation of the mean residence time in cells surrounded by thin layers, Math. Comput. Simul. 143, 65-77 (2018) .DOI
  16. [23]D. S. Grebenkov, Probability distribution of the boundary local time of reflected Brownian motion in Euclidean domains, Phys. Rev. E 100, 062110 (2019).DOI
  17. [24]D. S. Grebenkov, Surface Hopping Propagator: An Alternative Approach to Diffusion-Influenced Reactions, Phys. Rev. E 102, 032125 (2020).DOI
  18. [25]K. K. Sabelfeld, Monte Carlo Methods in Boundary Value Problems (Springer-Verlag: New York - Heidelberg, Berlin, 1991).
  19. [26]K. K. Sabelfeld and N. A. Simonov, Random Walks on Boundary for Solving PDEs (Utrecht, The Netherlands, 1994).DOI
  20. [27]G. N. Milshtein, Numerical Integration of Stochastic Differential Equations (Kluwer, Dordrecht, The Netherlands, 1995).
  21. [28]S. Litwin, Monte Carlo simulation of particle adsorption rates at high cell concentration, Biophys. J. 31, 271-277 (1980).pubmed.ncbi.nlm.nih.gov/7020784
  22. [29]S. Torquato and I. C. Kim, Efficient simulation technique to compute effective properties of heterogeneous media, Appl. Phys. Lett. 55, 1847 (1989).
  23. [30]L. H. Zheng and Y. C. Chiew, Computer simulation of diffusion-controlled reactions in dispersions of spherical sinks, J. Chem. Phys. 90, 322-327 (1989).
  24. [31]P. C. Bressloff, I. C. Kim, C. A. Miller, and S. Torquato, Random-walk simulation of diffusion-controlled processes among static traps, Phys. Rev. B 39, 11833-11839 (1989).
  25. [32]P. Ossadnik, Multiscaling Analysis of Large-Scale Off-Lattice DLA, Physica A 176, 454 (1991).DOI
  26. [33]L. Batsilas, M. A. Berezhkovskii, and S. Y. Shvartsman, Stochastic model of autocrine and paracrine signals in cell culture assays, Biophys. J. 85, 3659-3665 (2003).pubmed.ncbi.nlm.nih.gov/14645058
  27. [34]L. Dagdug, A. Berezhkovskii, S. M. Bezrukov, and G. H. Weiss, Diffusion-controlled reactions with a binding site hidden in a channel, J. Chem. Phys. 118, 2367-2373 (2003).DOI
  28. [35]D. S. Grebenkov, What Makes a Boundary Less Accessible, Phys. Rev. Lett. 95, 200602 (2005).
  29. [36]D. S. Grebenkov, A. A. Lebedev, M. Filoche and B. Sapoval, Multifractal Properties of the Harmonic Measure on Koch Boundaries in Two and Three Dimensions, Phys. Rev. E 71, 056121 (2005).pubmed.ncbi.nlm.nih.gov/16089616
  30. [37]D. S. Grebenkov, Scaling Properties of the Spread Harmonic Measures, Fractals 14, 231-243 (2006).DOI
  31. [38]P. Levitz, D. S. Grebenkov, M. Zinsmeister, K. Kolwankar and B. Sapoval, Brownian flights over a fractal nest and first passage statistics on irregular surfaces, Phys. Rev. Lett. 96, 180601 (2006).pubmed.ncbi.nlm.nih.gov/16712352
  32. [39]M. Deaconu and A. Lejay, A Random Walk on Rectangles Algorithm, Method. Comput. Appl. Probab. 8, 135-151 (2006).
  33. [40]T. Opplestrup, V. V. Bulatov, G. H. Gilmer, M. H. Kalos, and B. Sadigh, First-passage Monte Carlo algorithm: Diffusion without all the hops, Phys. Rev. Lett. 97, 230602 (2006).pubmed.ncbi.nlm.nih.gov/17280187
  34. [41]M. Hall and D. C. Alexander, Convergence and Parameter Choice for Monte-Carlo Simulations of Diffusion MRI, IEEE Trans. Med. Imag. 28, 1354 (2009).DOI
  35. [42]S. Zein, A. Lejay, and M. Deaconu, An efficient algorithm to simulate a Brownian motion over irregular domains, Commun. Comput. Phys. 8, 901-916 (2010).DOI
  36. [43]A. M. Berezhkovskii, L. Dagdug, M.-V. Vazquez, V. A. Lizunov, J. Zimmerberg, and S. M. Bezrukov, Trapping of diffusing particles by clusters of absorbing disks on a reflecting wall with disk centers on sites of a square lattice, J. Chem. Phys. 138, 064105 (2013).DOI
  37. [44]S. K. Ghosh, A. G. Cherstvy, and R. Metzler, Non-universal tracer diffusion in crowded media of non-inert obstacles, Phys. Chem. Chem. Phys. 17, 187-1858 (2015).DOI
  38. [45]S. K. Ghosh, A. G. Cherstvy, D. S. Grebenkov, and R. Metzler, Anomalous, non-Gaussian tracer diffusion in heterogeneously crowded environments, New J. Phys. 18, 013027 (2016).DOI
  39. [46]A. J. Bernoff, A. E. Lindsay, and D. D. Schmidt, Boundary Homogenization and Capture Time Distributions of Semipermeable Membranes with Periodic Patterns of Reactive Sites, Multiscale Model. Simul. 16, 1411-1447 (2018).DOI
  40. [47]M. Palombo, D. C. Alexander, and H. Zhang, A generative model of realistic brain cells with application to numerical simulation of the diffusion-weighted MR signal, NeuroImage 188, 391-402 (2019).
  41. [48]A. Ianus, D. C. Alexander, H. Zhang, and M. Palombo, Mapping complex cell morphology in the grey matter with double diffusion encoding MR: A simulation study, NeuroImage 241, 118424 (2021).DOI
  42. [49]F. Le Vot, S. B. Yuste, E. Abad, and D. S. Grebenkov, First-encounter time of two diffusing particles in two- and three-dimensional confinement, Phys. Rev. E 105, 044119 (2022).DOI
  43. [50]J. Cherry, A.E. Lindsay, A. Navarro Hernández, and B. Quaife, Trapping of planar Brownian motion: full first passage time distributions by kinetic Monte Carlo, asymptotic, and boundary integral methods, Multiscale Model. Simul. 20, 1284-1314 (2022).arxiv.org/abs/2112.06842
  44. [51]M. Bossy, E. Gobet, and D. Talay, A symmetrized Euler scheme for an efficient approximation of reflected diffusions, J. Appl. Probab. 41, 877-889 (2004).
  45. [52]D. S. Grebenkov, Residence times and other functionals of reflected Brownian motion, Phys. Rev. E 76, 041139 (2007).pubmed.ncbi.nlm.nih.gov/17994968
  46. [53]M. E. Muller, Some Continuous Monte Carlo Methods for the Dirichlet Problem, Ann. Math. Statist. 27, 569 (1956).DOI
  47. [54]Y. Zhou, W. Cai, and E. Hsu, Computation of the local time of reflecting Brownian motion and the probabilistic representation of the Neumann problem, Comm. Math. Sci. 15, 237-259 (2017).
  48. [55]R. D. Schumm and P. C. Bressloff, A numerical method for solving snapping out Brownian motion in 2D bounded domains, J. Comput. Phys. 493, 112479 (2023).
  49. [56]Y. Scher, S. Reuveni, and D. S. Grebenkov, Escape of a sticky particle, Phys. Rev. Research 5, 043196 (2023).DOI
  50. [57]Y. Scher, S. Reuveni, and D. S. Grebenkov, Escape from textured adsorbing surfaces, J. Chem. Phys. 160, 184105 (2024).DOI
  51. [58]D. S. Grebenkov, Encounter-based approach to the escape problem, Phys. Rev. E 107, 044105 (2023).DOI
  52. [59]I. Binder and M. Braverman, The rate of convergence of the walk of sphere algorithm, Geom. Funct. Anal. 22, 558-587 (2012).arxiv.org/abs/0810.3343
  53. [60]M. Levitin, D. Mangoubi, and I. Polterovich, Topics in Spectral Geometry (Vol. 237), American Mathematical Society (2023)DOI
  54. [61]T. Carlsson, T. Ekholm, and C. Elvingson, Algorithm for generating a Brownian motion on a sphere, J. Phys. A: Math. Theor. 43, 505001 (2010).
  55. [62]K. Burrage, P. M. Burrage, and G. Lythe, Effective numerical methods for simulating diffusion on a spherical surface in three dimensions, Numer. Algor. 91, 1577-1596 (2022).DOI
  56. [63]S. B. Yuste, E. Abad, and K. Lindenberg, Exploration and trapping of mortal random walkers, Phys. Rev. Lett. 110, 220603 (2013).DOI
  57. [64]B. Meerson and S. Redner, Mortality, redundancy, and diversity in stochastic search, Phys. Rev. Lett. 114, 198101 (2015).DOI
  58. [65]D. S. Grebenkov and J.-F. Rupprecht, The escape problem for mortal walkers, J. Chem. Phys. 146, 084106 (2017).DOI
  59. [66]S. Maire and E. Tanré, Monte Carlo approximation of the Neumann problem, Monte Carlo Methods Appl. 19, 201-236 (2013).arxiv.org/abs/1203.4910
  60. [67]D. S. Grebenkov, A fast random walk algorithm for computing the pulsed-gradient spin-echo signal in multiscale porous media, J. Magn. Reson. 208, 243-255 (2011).DOI
  61. [68]A. Chaigneau and D. S. Grebenkov, A numerical study of the Dirichlet-to-Neumann operator in planar domains, J. Phys. A: Math. Theor. 57, 445201 (2024).DOI
  62. [69]D. S. Grebenkov, Joint distribution of multiple boundary local times and related first-passage time problems with multiple targets, J. Stat. Mech. 103205 (2020).DOI
  63. [70]P. N. Bichariotti, P. C. Bichariotti, and F. Sartoretto, Numerical approximation for functionals of reflecting diffusion processes, SIAM J. Appl. Math. 58, 73-102 (1998).
  64. [71]G. N. Milstein, Application of the numerical integration of stochastic equations for the solution of boundary-value problems with Neumann’s boundary conditions, Theory Probab. Appl. 41, 170-177 (1996).
  65. [72]G. N. Milstein, Weak approximation of a diffusion process in a bounded domain, Stoch. Stoch. Rep. 62, 147-200 (1997).DOI
  66. [73]L. Słomiński, Euler’s approximations of solutions of SDEs with reflecting boundary, Stoch. Proc. Appl. 94, 317-337 (2001).
  67. [74]G. N. Milstein and M. V. Tretyakov, Stochastic Numerics for Mathematical Physics. Scientific Computation (Springer, Berlin, 2004).
  68. [75]F. Bernal and J. A. Acebrón, A comparison of higher-order weak numerical schemes for stochastic differential equations in bounded domains, Commun. Comput. Phys. 20, 703-732 (2016).DOI
  69. [76]F. Bernal, An implementation of Milstein’s method for general bounded diffusions, J. Sci. Comp. 79, 867-890 (2019).arxiv.org/abs/1802.09785
  70. [77]B. Leimkuhler, A. Sharma, and M. V. Tretyakov, Simplest random walk for approximating Robin boundary value problems and ergodic limits of reflected diffusions, Ann. Appl. Probab. 33, 1904-1960 (2023).DOI
  71. [78]D. S. Grebenkov, Analytical representations of the spread harmonic measure density, Phys. Rev. E. 91(5), 052108 (2015).pubmed.ncbi.nlm.nih.gov/26066120
  72. [79]S. Redner, A Guide to First Passage Processes (Cambridge University press, 2001).
  73. [80]Z. Schuss, Brownian Dynamics at Boundaries and Interfaces in Physics, Chemistry and Biology (Springer, New York, 2013).DOI
  74. [81]R. Metzler, G. Oshanin, and S. Redner (Eds), First-Passage Phenomena and Their Applications (World Scientific Press, Singapore, 2014).
  75. [82]J. Masoliver, Random Processes: First-passage and Escape (World Scientific, 2018).
  76. [83]K. Lindenberg, R. Metzler, and G. Oshanin (Eds), Chemical Kinetics: Beyond the Textbook (World Scientific, New Jersey, 2019).
  77. [84]L. Dagdug , J. Peña , and I. Pompa-García, Diffusion Under Confinement: A Journey Through Counterintuitive (Springer, 2024).
  78. [85]D. S. Grebenkov, R. Metzler, and G. Oshanin (Eds), Target Search Problems (Springer, Cham, 2024).
  79. [86]E. Hsu, Probabilistic approach to the neumann problem, Commun. Pure Appl. Math. 38, 445 (1985).
  80. [87]V. G. Papanicolaou, The probabilistic solution of the third boundary value problem for second order elliptic equations, Probab. Theory Relat. Fields 87, 27 (1990).
  81. [88]F. Yang and W. Cai, Numerical Solution of the Robin Problem of Laplace Equations with a Feynman-Kac Formula and Reflecting Brownian Motions, J. Scient. Comp. 69, 107-121 (2016).
  82. [89]G. A. Brosamler, A probabilistic solution of the Neumann problem, Mathematica Scandinavica. 38, 137-147 (1976).DOI
  83. [90]A. Benchérif-Madani and É. Pardoux, A probabilistic formula for a Poisson equation with Neumann boundary condition, Stoch. Anal. Appl. 27, 739-746 (2009).
  84. [91]P. L. Lions and A. S. Sznitman, Stochastic differential equations with reflecting boundary conditions, Comm. Pure Appl. Math. 37, 511-537 (1984).DOI
  85. [92]J. P. Morillon, Numerical solutions of linear mixed boundary value problems using stochastic representations, Int. J. Numer. Meth. Engng. 40, 387-405 (1997).
  86. [93]D. S. Grebenkov Efficient Monte Carlo methods for simulating diffusion-reaction processes in complex systems, in ”First-Passage Phenomena and Their Applications”, Eds. R. Metzler, G. Oshanin, S. Redner (World Scientific Press, Singapore, 2014).arxiv.org/abs/1304.7807
  87. [94]D. S. Grebenkov and S. D. Traytak, Semi-analytical computation of Laplacian Green functions in three-dimensional domains with disconnected spherical boundaries, J. Comput. Phys. 379, 91-117 (2017).DOI

Paper details

vlnc:W_prserbr3
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 11

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents