APPROXIMATIONS IN BIVARIATE RENEWAL THEORY

We construct approximations to the renewal function for a bi- variate renewal process. Suppose (X, Y), (X-1,Y-1), (X-2, X-2), ... denote i.i.d. positive random vectors with common distribution function F(x, y) = P(X <= x, Y <= y). Let S-n((1)) = X-1 + X-2 + . . . + X-n and S-n((2)) = Y-1 + Y-2 + . . . + Y-n denote the partial sums where we set S-0(1) = S-0(2) = 0. Associated with {(X-i, Y-i)}, we define, respectively, the univariate and bivariate renewal counting processes: N-i(x) = min{n >= 1 : S-n((i)) > x} (i = 1,2) and N(x,y) = min{N-1 (x), N-2 (y)}. The bivariate renewal function is given by U(x, y) = E N(x,y) = E N (x,y) = Sigma(infinity)(0) F*(n)(x, y). From the practical point of view it is hard to find explicit expressions for the renewal function U(x, y). Recently, Mitov and Omey (2014) introduced a new method to obtain approximations for univariate renewal functions based on expansions of Laplace-Stieltjes transforms. In this paper we generalize these approximations to the bivariate case and apply them to regularly varying increments. We show that the approximation along the diagonal is different from off the diagonal.