Hostname: page-component-89b8bd64d-4ws75 Total loading time: 0 Render date: 2026-05-07T02:52:23.248Z Has data issue: false hasContentIssue false

FROM BOUNDARY CROSSING OF NON-RANDOM FUNCTIONS TO BOUNDARY CROSSING OF STOCHASTIC PROCESSES

Published online by Cambridge University Press:  17 April 2015

Mark Brown
Affiliation:
Department of Statistics, Columbia University, New York, NY 10027, USA E-mail: cybergarf@aol.com
Victor de la Peña
Affiliation:
Department of Statistics, Columbia University, New York, NY 10027, USA E-mail: vp@stat.columbia.edu
Tony Sit
Affiliation:
Department of Statistics, The Chinese University of Hong Kong, Hong Kong SAR E-mail: tonysit@sta.cuhk.edu.hk

Abstract

One problem of wide interest involves estimating expected crossing-times. Several tools have been developed to solve this problem beginning with the works of Wald and the theory of sequential analysis. Deriving the explicit close form solution for the expected crossing times may be difficult. In this paper, we provide a framework that can be used to estimate expected crossing times of arbitrary stochastic processes. Our key assumption is the knowledge of the average behavior of the supremum of the process. Our results include a universal sharp lower bound on the expected crossing times. Furthermore, for a wide class of time-homogeneous, Markov processes, including Bessel processes, we are able to derive an upper bound E[a(T r )]≤2r, which implies that sup r>0|((E[a(T r )]−r)/r)|≤1, where a(t)=E[sup t X t ] with {X t }t≥0 be a non-negative, measurable process. This inequality motivates our claim that a(t) can be viewed as a natural clock for all such processes. The cases of multidimensional processes, non-symmetric and random boundaries are handled as well. We also present applications of these bounds on renewal processes in Example 10 and other stochastic processes.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2015 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable