Abstract:Fastest arrival events, where the first among many diffusing particles reaches a target, are central in triggering signal initiation in molecular stochastic systems. Classical approaches to simulate such events rely on full trajectory generation of all particles, leading to prohibitive computational costs in the large particle number regime. In this work, we present a general simulation framework for efficiently generating order statistics of arrival times by exploiting asymptotic first-passage distributions. This framework applies to diffusion processes in bounded domains with localized absorbing targets, for which short-time first-passage asymptotics are available, such as Brownian motion in dimensions one, two, and three. Starting with the case of instantaneous emission, we derive and implement a recursive inverse transform algorithm to simulate the first $k$ arrivals without tracking particle trajectories. We extend this algorithm to time-dependent emission profiles via an iterative approach, enabling the simulation of extreme statistics in systems with temporal injection, ranging from rapid to prolonged emission. Additionally, we provide asymptotic estimates of the mean fastest arrival time. To conclude, the present acceleration algorithm which bypasses Brownian simulations of trajectories can be used for spatial reaction networks, rare event detection, or diffusion-controlled activation.
| Comments: | 28pages, 7 figures |
| Subjects: | Probability (math.PR); Statistical Mechanics (cond-mat.stat-mech); Quantitative Methods (q-bio.QM) |
| MSC classes: | 60J65 60G70 65C05 65C20 82C31 |
| Cite as: | arXiv:2605.25295 [math.PR] |
| (or arXiv:2605.25295v1 [math.PR] for this version) | |
| https://doi.org/10.48550/arXiv.2605.25295 arXiv-issued DOI via DataCite (pending registration) |
From: David Holcman [view email]
[v1]
Sun, 24 May 2026 23:17:38 UTC (612 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。