FROM BOUNDARY CROSSING OF NON-RANDOM FUNCTIONS TO BOUNDARY CROSSING OF STOCHASTIC PROCESSES. Issue 3 (17th April 2015)
- Record Type:
- Journal Article
- Title:
- FROM BOUNDARY CROSSING OF NON-RANDOM FUNCTIONS TO BOUNDARY CROSSING OF STOCHASTIC PROCESSES. Issue 3 (17th April 2015)
- Main Title:
- FROM BOUNDARY CROSSING OF NON-RANDOM FUNCTIONS TO BOUNDARY CROSSING OF STOCHASTIC PROCESSES
- Authors:
- Brown, Mark
de la Peña, Victor
Sit, Tony - Abstract:
- <abstract abstract-type="normal"> <title> <x content-type="archive" xml:space="preserve">Abstract</x> </title> <p>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 <italic>E</italic>[<italic>a</italic>(<italic>T</italic><sub><italic>r</italic></sub>)]≤2<italic>r</italic>, which implies that sup <sub><italic>r</italic>&gt;0</sub>|((<italic>E</italic>[<italic>a</italic>(<italic>T</italic><sub><italic>r</italic></sub>)]−<italic>r</italic>)/<italic>r</italic>)|≤1, where <italic>a</italic>(<italic>t</italic>)=<italic>E</italic>[sup <sub><italic>t</italic></sub><italic>X</italic><sub><italic>t</italic></sub>] with {<italic>X</italic><sub><italic>t</italic></sub>}<sub><italic>t</italic>≥0</sub> be a non-negative, measurable process. This inequality motivates our claim that <italic>a</italic>(<italic>t</italic>) can<abstract abstract-type="normal"> <title> <x content-type="archive" xml:space="preserve">Abstract</x> </title> <p>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 <italic>E</italic>[<italic>a</italic>(<italic>T</italic><sub><italic>r</italic></sub>)]≤2<italic>r</italic>, which implies that sup <sub><italic>r</italic>&gt;0</sub>|((<italic>E</italic>[<italic>a</italic>(<italic>T</italic><sub><italic>r</italic></sub>)]−<italic>r</italic>)/<italic>r</italic>)|≤1, where <italic>a</italic>(<italic>t</italic>)=<italic>E</italic>[sup <sub><italic>t</italic></sub><italic>X</italic><sub><italic>t</italic></sub>] with {<italic>X</italic><sub><italic>t</italic></sub>}<sub><italic>t</italic>≥0</sub> be a non-negative, measurable process. This inequality motivates our claim that <italic>a</italic>(<italic>t</italic>) 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.</p> </abstract> … (more)
- Is Part Of:
- Probability in the engineering and informational sciences. Volume 29:Issue 3(2015)
- Journal:
- Probability in the engineering and informational sciences
- Issue:
- Volume 29:Issue 3(2015)
- Issue Display:
- Volume 29, Issue 3 (2015)
- Year:
- 2015
- Volume:
- 29
- Issue:
- 3
- Issue Sort Value:
- 2015-0029-0003-0000
- Page Start:
- 345
- Page End:
- 359
- Publication Date:
- 2015-04-17
- Subjects:
- Probabilities -- Periodicals
Engineering -- Statistical methods -- Periodicals
Information science -- Statistical methods -- Periodicals
519.202462 - Journal URLs:
- http://journals.cambridge.org/action/displayJournal?jid=PES ↗
- DOI:
- 10.1017/S0269964815000030 ↗
- Languages:
- English
- ISSNs:
- 0269-9648
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library STI - ELD Digital store
- Ingest File:
- 3880.xml