Predicting The Ultimate Supremum Of A Stable Levy Process With No Negative Jumps

Given a stable Levy process X = (X-t)(0 <= t <= T) of index alpha is an element of (1, 2) with no negative jumps, and letting S-t = sup(0 <= s <= t) X-s denote its running supremum for t is an element of [0, T], we consider the optimal prediction problem


Published in:
Annals Of Probability, 39, 2385-2423
Year:
2011
Keywords:
Laboratories:




 Record created 2012-06-12, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)