اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptimal mean first-passage time of a Brownian searcher with resetting in one and two dimensions: Experiments, theory and numerical tests
155
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study experimentally, numerically and theoretically the optimal mean time needed by a Brownian particle, freely diffusing either in one or two dimensions, to reach, within a tolerance radius $R_{text tol}$, a target at a distance $L$ from an initial position in the presence of resetting. The reset position is Gaussian distributed with width $sigma$. We derived and tested two resetting protocols, one with a periodic and one with random (Poissonian) resetting times. We computed and measured the full first-passage probability distribution that displays spectacular spikes immediately after each resetting time for close targets. We study the optimal mean first-passage time as a function of the resetting period/rate for different target distances (values of the ratios $b=L/sigma$) and target size ($a=R_text{tol}/L$). We find an interesting phase transition at a critical value of $b$, both in one and two dimensions. The details of the calculations as well as experimental setup and limitations are discussed.
قيم البحث
اقرأ أيضاً
We combine the processes of resetting and first-passage to define emph{first-passage resetting}, where the resetting of a random walk to a fixed position is triggered by a first-passage event of the walk itself. In an infinite domain, first-passage r
esetting of isotropic diffusion is non-stationary, with the number of resetting events growing with time as $sqrt{t}$. We calculate the resulting spatial probability distribution of the particle analytically, and also obtain this distribution by a geometric path decomposition. In a finite interval, we define an optimization problem that is controlled by first-passage resetting; this scenario is motivated by reliability theory. The goal is to operate a system close to its maximum capacity without experiencing too many breakdowns. However, when a breakdown occurs the system is reset to its minimal operating point. We define and optimize an objective function that maximizes the reward (being close to maximum operation) minus a penalty for each breakdown. We also investigate extensions of this basic model to include delay after each reset and to two dimensions. Finally, we study the growth dynamics of a domain in which the domain boundary recedes by a specified amount whenever the diffusing particle reaches the boundary after which a resetting event occurs. We determine the growth rate of the domain for the semi-infinite line and the finite interval and find a wide range of behaviors that depend on how much the recession occurs when the particle hits the boundary.
We investigate classic diffusion with the added feature that a diffusing particle is reset to its starting point each time the particle reaches a specified threshold. In an infinite domain, this process is non-stationary and its probability distribut
ion exhibits rich features. In a finite domain, we define a non-trivial optimization in which a cost is incurred whenever the particle is reset and a reward is obtained while the particle stays near the reset point. We derive the condition to optimize the net gain in this system, namely, the reward minus the cost.
We investigate the mean first passage time of an active Brownian particle in one dimension using numerical simulations. The activity in one dimension is modeled as a two state model; the particle moves with a constant propulsion strength but its orie
ntation switches from one state to other as in a random telegraphic process. We study the influence of a finite resetting rate $r$ on the mean first passage time to a fixed target of a single free Active Brownian Particle and map this result using an effective diffusion process. As in the case of a passive Brownian particle, we can find an optimal resetting rate $r^*$ for an active Brownian particle for which the target is found with the minimum average time. In the case of the presence of an external potential, we find good agreement between the theory and numerical simulations using an effective potential approach.
We present the analysis of the first passage time problem on a finite interval for the generalized Wiener process that is driven by Levy stable noises. The complexity of the first passage time statistics (mean first passage time, cumulative first pas
sage time distribution) is elucidated together with a discussion of the proper setup of corresponding boundary conditions that correctly yield the statistics of first passages for these non-Gaussian noises. The validity of the method is tested numerically and compared against analytical formulae when the stability index $alpha$ approaches 2, recovering in this limit the standard results for the Fokker-Planck dynamics driven by Gaussian white noise.
We provide an analytic solution to the first-passage time (FPT) problem of a piecewise-smooth stochastic model, namely Brownian motion with dry friction, using two different but closely related approaches which are based on eigenfunction decompositio
ns on the one hand and on the backward Kolmogorov equation on the other. For the simple case containing only dry friction, a phase transition phenomenon in the spectrum is found which relates to the position of the exit point, and which affects the tail of the FPT distribution. For the model containing as well a driving force and viscous friction the impact of the corresponding stick-slip transition and of the transition to ballistic exit is evaluated quantitatively. The proposed model is one of the very few cases where FPT properties are accessible by analytical means.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
