zbMATH — the first resource for mathematics

Ladder heights, Gaussian random walks and the Riemann zeta function. (English) Zbl 0880.60070
Summary: Let \(\{S_n: n\geq 0\}\) be a random walk having normally distributed increments with mean \(\theta\) and variance 1, and let \(\tau\) be the time at which the random walk first takes a positive value, so that \(S_\tau\) is the first ladder height. Then the expected value \(E_\theta S_\tau\), originally defined for positive \(\theta\), may be extended to be an analytic function of the complex variable \(\theta\) throughout the entire complex plane, with the exception of certain branch point singularities. In particular, the coefficients in a Taylor expansion about \(\theta=0\) may be written explicitly as simple expressions involving the Riemann zeta function. Previously only the first coefficient of the series developed here was known; this term has been used extensively in developing approximations for boundary crossing problems for Gaussian random walks. Knowledge of the complete series makes more refined results possible; we apply it to derive asymptotics for boundary crossing probabilities and the limiting expected overshoot.

60G50 Sums of independent random variables; random walks
30B40 Analytic continuation of functions of one complex variable
11M06 \(\zeta (s)\) and \(L(s, \chi)\)
Full Text: DOI
[1] Asmussen, S. (1987). Applied Probability and Queues. Wiley, New York. · Zbl 0624.60098
[2] Asmussen, S., Glynn, P. and Pitman, J. (1995). Discretization error in simulation of onedimensional reflecting Brownian motion. Ann. Appl. Probab. 5 875-896. · Zbl 0853.65147 · doi:10.1214/aoap/1177004597
[3] Chang, J. T. (1992). On moments of the first ladder height of random walks with small drift. Ann. Appl. Probab. 2 714-738. · Zbl 0760.60064 · doi:10.1214/aoap/1177005656
[4] Chernoff, H. (1965). Sequential test for the mean of a normal distribution IV (discrete case). Ann. Math. Statist. 36 55-68. · Zbl 0246.62084 · doi:10.1214/aoms/1177700270
[5] Feller, W. (1971). An Introduction to Probability Theory and Its Applications 2, 2nd ed. Wiley, New York. · Zbl 0219.60003
[6] Grandell, J. (1991). Aspects of Risk Theory. Springer, Berlin. · Zbl 0717.62100
[7] Hardy, G. H. (1905). A method for determining the behavior of certain classes of power series near a singular point on the circle of convergence. Proc. London Math. Soc. 2 381-389. · JFM 36.0474.01
[8] Hogan, M. (1986). Comments on a problem of Chernoff and Petkau. Ann. Probab. 14 1058-1063. · Zbl 0658.60070 · doi:10.1214/aop/1176992458
[9] Lai, T. L. (1976). Asymptotic moments of random walks with applications to ladder variables and renewal theory. Ann. Probab. 4 51-66. · Zbl 0351.60062 · doi:10.1214/aop/1176996180
[10] Prabhu, N. U. (1980). Stochastic Storage Processes: Queues, Insurance Risk, and Dams. Springer, New York. · Zbl 0453.60094
[11] Siegmund, D. (1979). Corrected diffusion approximations in certain random walk problems. Adv. in Appl. Probab. 11 701-719. JSTOR: · Zbl 0422.60053 · doi:10.2307/1426855 · links.jstor.org
[12] Siegmund, D. (1985). Sequential Analysis: Tests and Confidence Intervals. Springer, New York. · Zbl 0573.62071
[13] Siegmund, D. (1986). Boundary crossing probabilities and statistical applications. Ann. Statist. 14 361-404. · Zbl 0632.62077 · doi:10.1214/aos/1176349928
[14] Titchmarsh, E. C. (1939). The Theory of Functions. Oxford Univ. Press. · JFM 65.0302.01
[15] Whitt, W. (1974). Heavy traffic limit theorems for queues: a survey. Lecture Notes in Econom. and Math. Systems 98 307-350. Springer, New York. · Zbl 0295.60081
[16] Woodroofe, M. (1982). Nonlinear Renewal Theory in Sequential Analysis. SIAM, Philadelphia. · Zbl 0487.62062
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.