First passage time distributions for finite one-dimensional random walks

Pramana ◽  
1983 ◽  
Vol 21 (2) ◽  
pp. 111-122 ◽  
Author(s):  
M Khantha ◽  
V Balakrishnan
Keyword(s):  
Random Walks ◽  
First Passage Time ◽  
Passage Time ◽  
First Passage ◽  
One Dimensional

First-passage-time densities for time-non-homogeneous diffusion processes

1997 ◽  
Vol 34 (3) ◽  
pp. 623-631 ◽  
Author(s):  
R. Gutiérrez ◽  
L. M. Ricciardi ◽  
P. Román ◽  
F. Torres
Keyword(s):  
Diffusion Processes ◽  
First Passage Time ◽  
Passage Time ◽  
Continuous Functions ◽  
Probability Density Functions ◽  
Density Functions ◽  
First Passage ◽  
One Dimensional ◽  
Dimensional Diffusion ◽  
Natural Boundaries

In this paper we study a Volterra integral equation of the second kind, including two arbitrary continuous functions, in order to determine first-passage-time probability density functions through time-dependent boundaries for time-non-homogeneous one-dimensional diffusion processes with natural boundaries. These results generalize those which were obtained for time-homogeneous diffusion processes by Giorno et al. [3], and for some particular classes of time-non-homogeneous diffusion processes by Gutiérrez et al. [4], [5].

Calculations of first passage time of delayed tree-like networks

2015 ◽  
Vol 29 (28) ◽  
pp. 1550200
Author(s):  
Shuai Wang ◽  
Weigang Sun ◽  
Song Zheng
Keyword(s):  
Random Walks ◽  
First Passage Time ◽  
Passage Time ◽  
The Novel ◽  
Mean First Passage Time ◽  
First Passage ◽  
Initial Node ◽  
Network Parameters ◽  
Self Similar ◽  
The Mean

In this paper, we study random walks in a family of delayed tree-like networks controlled by two network parameters, where an immobile trap is located at the initial node. The novel feature of this family of networks is that the existing nodes have a time delay to give birth to new nodes. By the self-similar network structure, we obtain exact solutions of three types of first passage time (FPT) measuring the efficiency of random walks, which includes the mean receiving time (MRT), mean sending time (MST) and mean first passage time (MFPT). The obtained results show that the MRT, MST and MFPT increase with the network parameters. We further show that the values of MRT, MST and MFPT are much shorter than the nondelayed counterpart, implying that the efficiency of random walks in delayed trees is much higher.

scholarly journals Mean first-passage time for random walks on the T-graph

2009 ◽  
Vol 11 (10) ◽  
pp. 103043 ◽  
Author(s):  
Zhongzhi Zhang ◽  
Yuan Lin ◽  
Shuigeng Zhou ◽  
Bin Wu ◽  
Jihong Guan
Keyword(s):  
Random Walks ◽  
First Passage Time ◽  
Passage Time ◽  
Mean First Passage Time ◽  
First Passage

scholarly journals The First Passage Time and the Dividend Value Function for One-Dimensional Diffusion Processes between Two Reflecting Barriers

2012 ◽  
Vol 2012 ◽  
pp. 1-15 ◽  
Author(s):  
Chuancun Yin ◽  
Huiqing Wang
Keyword(s):  
Boundary Conditions ◽  
Value Function ◽  
Diffusion Processes ◽  
First Passage Time ◽  
Passage Time ◽  
First Passage ◽  
One Dimensional ◽  
The Laplace Transform ◽  
The Value Function ◽  
Reflecting Barriers

We consider the general one-dimensional time-homogeneous regular diffusion process between two reflecting barriers. An approach based on the Itô formula with corresponding boundary conditions allows us to derive the differential equations with boundary conditions for the Laplace transform of the first passage time and the value function. As examples, the explicit solutions of them for several popular diffusions are obtained. In addition, some applications to risk theory are considered.

scholarly journals LQG Homing in a Finite Time Interval

2011 ◽  
Vol 2011 ◽  
pp. 1-3 ◽  
Author(s):  
Mario Lefebvre
Keyword(s):  
Optimal Control ◽  
Diffusion Process ◽  
First Passage Time ◽  
Passage Time ◽  
Time Interval ◽  
Finite Time Interval ◽  
First Passage ◽  
One Dimensional ◽  
Dimensional Diffusion ◽  
Fixed Constant

LetX(t)be a controlled one-dimensional diffusion process having constant infinitesimal variance. We consider the problem of optimally controllingX(t)until timeT(x)=min{T1(x),t1}, whereT1(x)is the first-passage time of the process to a given boundary andt1is a fixed constant. The optimal control is obtained explicitly in the particular case whenX(t)is a controlled Wiener process.

Sign in / Sign up

Export Citation Format

Share Document