scholarly journals First-passage time asymptotics over moving boundaries for random walk bridges

2018 ◽  
Vol 55 (2) ◽  
pp. 627-651 ◽  
Author(s):  
Fiona Sloothaak ◽  
Vitali Wachtel ◽  
Bert Zwart

Abstract We study the asymptotic tail behavior of the first-passage time over a moving boundary for a random walk conditioned to return to zero, where the increments of the random walk have finite variance. Typically, the asymptotic tail behavior may be described through a regularly varying function with exponent -½, where the impact of the boundary is captured by the slowly varying function. Yet, the moving boundary may have a stronger effect when the tail is considered at a time close to the return point of the random walk bridge, leading to a possible phase transition depending on the order of the distance between zero and the moving boundary.

2012 ◽  
Vol 22 (5) ◽  
pp. 1860-1879 ◽  
Author(s):  
Marat V. Burnashev ◽  
Aslan Tchamkerten

2018 ◽  
Vol 13 (1) ◽  
pp. 10 ◽  
Author(s):  
Pengbo Xu ◽  
Weihua Deng

For the particles undergoing the anomalous diffusion with different waiting time distributions for different internal states, we derive the Fokker-Planck and Feymann-Kac equations, respectively, describing positions of the particles and functional distributions of the trajectories of particles; in particular, the equations governing the functional distribution of internal states are also obtained. The dynamics of the stochastic processes are analyzed and the applications, calculating the distribution of the first passage time and the distribution of the fraction of the occupation time, of the equations are given. For the further application of the newly built models, we make very detailed discussions on the none-immediately-repeated stochastic process, e.g., the random walk of smart animals.


2014 ◽  
Vol 25 (09) ◽  
pp. 1450037 ◽  
Author(s):  
Feng Zhu ◽  
Meifeng Dai ◽  
Yujuan Dong ◽  
Jie Liu

This paper reports a weighted hierarchical network generated on the basis of self-similarity, in which each edge is assigned a different weight in the same scale. We studied two substantial properties of random walk: the first-passage time (FPT) between a hub node and a peripheral node and the FPT from a peripheral node to a local hub node over the network. Meanwhile, an analytical expression of the average sending time (AST) is deduced, which reflects the average value of FPT from a hub node to any other node. Our result shows that the AST from a hub node to any other node is related to the scale factor and the number of modules. We found that the AST grows sublinearly, linearly and superlinearly respectively with the network order, depending on the range of the scale factor. Our work may shed some light on revealing the diffusion process in hierarchical networks.


Sign in / Sign up

Export Citation Format

Share Document