English

First passage time for Slepian process with linear barrier

Probability 2019-04-17 v1 Statistics Theory Statistics Theory

Abstract

In this paper we extend results of L.A. Shepp by finding explicit formulas for the first passage probability Fa,b(Tx)=Pr(S(t)<a+bt for all t[0,T]S(0)=x)F_{a,b}(T\, |\, x)={\rm Pr}(S(t)<a+bt \text{ for all } t\in[0,T]\,\, | \,\,S(0)=x), for all T>0T>0, where S(t)S(t) is a Gaussian process with mean 0 and covariance ES(t)S(t)=max{0,1tt}.\mathbb{E} S(t)S(t')=\max\{0,1-|t-t'|\}\,. We then extend the results to the case of piecewise-linear barriers and outline applications to change-point detection problems. Previously, explicit formulas for Fa,b(Tx)F_{a,b}(T\, |\, x) were known only for the cases b=0b=0 (constant barrier) or T1T\leq 1 (short interval).

Cite

@article{arxiv.1904.07227,
  title  = {First passage time for Slepian process with linear barrier},
  author = {Jack Noonan and Anatoly Zhigljavsky},
  journal= {arXiv preprint arXiv:1904.07227},
  year   = {2019}
}
R2 v1 2026-06-23T08:40:13.249Z