Asymptotic expansions in multidimensional Markov renewal theory and first passage times for Markov random walks

2001 ◽  
Vol 33 (3) ◽  
pp. 652-673 ◽  
Author(s):  
Cheng-Der Fuh ◽  
Tze Leung Lai

We prove a d-dimensional renewal theorem, with an estimate on the rate of convergence, for Markov random walks. This result is applied to a variety of boundary crossing problems for a Markov random walk (Xn,Sn), n ≥0, in which Xn takes values in a general state space and Sn takes values in ℝd. In particular, for the case d = 1, we use this result to derive an asymptotic formula for the variance of the first passage time when Sn exceeds a high threshold b, generalizing Smith's classical formula in the case of i.i.d. positive increments for Sn. For d > 1, we apply this result to derive an asymptotic expansion of the distribution of (XT,ST), where T = inf { n : Sn,1 > b } and Sn,1 denotes the first component of Sn.

2001 ◽  
Vol 33 (03) ◽  
pp. 652-673 ◽  
Author(s):  
Cheng-Der Fuh ◽  
Tze Leung Lai

We prove a d-dimensional renewal theorem, with an estimate on the rate of convergence, for Markov random walks. This result is applied to a variety of boundary crossing problems for a Markov random walk (X n ,S n ), n ≥0, in which X n takes values in a general state space and S n takes values in ℝ d . In particular, for the case d = 1, we use this result to derive an asymptotic formula for the variance of the first passage time when S n exceeds a high threshold b, generalizing Smith's classical formula in the case of i.i.d. positive increments for S n . For d > 1, we apply this result to derive an asymptotic expansion of the distribution of (X T ,S T ), where T = inf { n : S n,1 > b } and S n,1 denotes the first component of S n .


2007 ◽  
Vol 39 (3) ◽  
pp. 826-852 ◽  
Author(s):  
Cheng-Der Fuh

Let {(Xn, Sn), n ≥ 0} be a Markov random walk in which Xn takes values in a general state space and Sn takes values on the real line R. In this paper we present some results that are useful in the study of asymptotic approximations of boundary crossing problems for Markov random walks. The main results are asymptotic expansions on moments of the first ladder height in Markov random walks with small positive drift. In order to establish the asymptotic expansions we study a uniform Markov renewal theorem, which relates to the rate of convergence for the distribution of overshoot, and present an analysis of the covariance between the first passage time and the overshoot.


2007 ◽  
Vol 39 (03) ◽  
pp. 826-852 ◽  
Author(s):  
Cheng-Der Fuh

Let {(X n , S n ), n ≥ 0} be a Markov random walk in which X n takes values in a general state space and S n takes values on the real line R. In this paper we present some results that are useful in the study of asymptotic approximations of boundary crossing problems for Markov random walks. The main results are asymptotic expansions on moments of the first ladder height in Markov random walks with small positive drift. In order to establish the asymptotic expansions we study a uniform Markov renewal theorem, which relates to the rate of convergence for the distribution of overshoot, and present an analysis of the covariance between the first passage time and the overshoot.


2019 ◽  
Vol 99 (6) ◽  
Author(s):  
Shant Baghram ◽  
Farnik Nikakhtar ◽  
M. Reza Rahimi Tabar ◽  
S. Rahvar ◽  
Ravi K. Sheth ◽  
...  

2015 ◽  
Vol 29 (28) ◽  
pp. 1550200
Author(s):  
Shuai Wang ◽  
Weigang Sun ◽  
Song Zheng

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.


2009 ◽  
Vol 11 (10) ◽  
pp. 103043 ◽  
Author(s):  
Zhongzhi Zhang ◽  
Yuan Lin ◽  
Shuigeng Zhou ◽  
Bin Wu ◽  
Jihong Guan

Sign in / Sign up

Export Citation Format

Share Document