Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Predicting The Ultimate Supremum Of A Stable Levy Process With No Negative Jumps
 
research article

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

Bernyk, Violetta
•
Dalang, Robert C.  
•
Peskir, Goran
2011
Annals Of Probability

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

  • Details
  • Metrics
Type
research article
DOI
10.1214/10-AOP598
Web of Science ID

WOS:000297849900008

Author(s)
Bernyk, Violetta
Dalang, Robert C.  
Peskir, Goran
Date Issued

2011

Published in
Annals Of Probability
Volume

39

Start page

2385

End page

2423

Subjects

Optimal prediction

•

optimal stopping

•

ultimate supremum

•

stable Levy process with no negative jumps

•

spectrally positive

•

fractional free-boundary problem

•

Riemann-Liouville fractional derivative

•

Caputo fractional derivative

•

stochastic process reflected at its supremum

•

infinitesimal generator

•

weakly singular Volterra integral equation

•

polar kernel

•

smooth fit

•

curved boundary

•

Brownian-Motion

•

Maximum

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
PROB  
Available on Infoscience
June 12, 2012
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/81605
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés