Results 11 to 20 of about 430,069 (325)
Asymptotic expansions for the first hitting times of Bessel processes [PDF]
Opuscula Mathematica, 2021 We study a precise asymptotic behavior of the tail probability of the first hitting time of the Bessel process. We deduce the order of the third term and decide the explicit form of its coefficient.
Yuji Hamana +2 more
doaj +1 more source
Square-root boundaries for Bessel processes and the hitting times of radial Ornstein-Uhlenbeck processes [PDF]
Opuscula Mathematica, 2023 This article deals with the first hitting times of a Bessel process to a square-root boundary. We obtain the explicit form of the distribution function of the hitting time by means of zeros of the confluent hypergeometric function with respect to the ...
Yuji Hamana
doaj +1 more source
Mean exit time for diffusion on irregular domains
New Journal of Physics, 2021 Many problems in physics, biology, and economics depend upon the duration of time required for a diffusing particle to cross a boundary. As such, calculations of the distribution of first passage time, and in particular the mean first passage time, is an
Matthew J Simpson +4 more
doaj +1 more source
Hitting times for Shamir’s problem [PDF]
Transactions of the American Mathematical Society, 2021 For fixed $r\geq 3$ and $n$ divisible by $r$, let ${\mathcal H}={\mathcal H}^r_{n,M}$ be the random $M$-edge $r$-graph on $V=\{1,\ldots ,n\}$; that is, ${\mathcal H}$ is chosen uniformly from the $M$-subsets of ${\mathcal K}:={V \choose r}$ ($:= \{\mbox{$r$-subsets of $V$}\}$).
openaire +2 more sources
Hitting time for random walks on the Sierpinski network and the half Sierpinski network
Frontiers in Physics, 2022 We consider the unbiased random walk on the Sierpinski network (Sn◦N) and the half Sierpinski network (HSn◦N), where n is the generation. Different from the existing works on the Sierpinski gasket, Sn◦N is generated by the nested method and HSn◦N is half
Yu Sun, Xiaobei Liu, Xiaoyan Li
doaj +1 more source
Hitting statistics from quantum jumps [PDF]
Quantum, 2017 We define the hitting time for a model of continuous-time open quantum walks in terms of quantum jumps. Our starting point is a master equation in Lindblad form, which can be taken as the quantum analogue of the rate equation for a classical continuous ...
A. Chia, T. Paterek, L. C. Kwek
doaj +1 more source
Direction-Based Hybrid Strategy Combining Pushing and Hitting for Fast Object Singulation
Applied Sciences, 2021 This paper presents a hybrid singulation strategy for fast object singulation in a cluttered environment. Recent techniques related to object singulation in clutter have employed various kinds of pushing techniques and in some cases have also used ...
Muhammad Umair Ahmad Khan +3 more
doaj +1 more source
Sliding Mode Controller for Nonlinear System Based on Genetic Algorithm [PDF]
Engineering and Technology Journal, 2014 Sliding Mode Controller (SMC) is a simple and effective method to recognize a robust controller for nonlinear system. It is a strong mathematical tool which gives a nonlinear robust controller with acceptable performance. The chattering phenomenon is the
Ahmed Khalaf Hamoudi
doaj +1 more source
Hitting times for random walks on tricyclic graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Let G be a simple connected graph and [Formula: see text] Let [Formula: see text] be the expected hitting time from x to y in G and [Formula: see text] be the hitting time of G, where [Formula: see text] A tricyclic graph is a simple connected graph that
Xiao-Min Zhu, Xu Yang
doaj +1 more source
Restart Expedites Quantum Walk Hitting Times
Physical Review Letters, 2023 Classical first-passage times under restart are used in a wide variety of models, yet the quantum version of the problem still misses key concepts. We study the quantum hitting time with restart using a monitored quantum walk. The restart strategy eliminates the problem of dark states, i.e.
R. Yin, E. Barkai
openaire +3 more sources