2015
DOI: 10.1017/s0001867800007771
|View full text |Cite
|
Sign up to set email alerts
|

Occupation Times, Drawdowns, and Drawups for One-Dimensional Regular Diffusions

Abstract: The drawdown process of a one-dimensional regular diffusion process X is given by X reflected at its running maximum. The drawup process is given by X reflected at its running minimum. We calculate the probability that a drawdown precedes a drawup in an exponential time-horizon. We then study the law of the occupation times of the drawdown process and the drawup process. These results are applied to address problems in risk analysis and for option pricing of the drawdown process. Finally, we present examples o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

2
45
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 26 publications
(47 citation statements)
references
References 35 publications
(33 reference statements)
2
45
0
Order By: Relevance
“…Drawdowns of spectrally negative Lévy processes were analyzed in Mijatovic and Pistorius (2012). The notion of drawup, which measures the maximum cumulative gain relative to a running minimum, has also been investigated probabilistically, particularly in terms of its relationship to drawdown; see for example Hadjiliadis and Vecer (2006), Pospisil et al (2009), andZhang andHadjiliadis (2010).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Drawdowns of spectrally negative Lévy processes were analyzed in Mijatovic and Pistorius (2012). The notion of drawup, which measures the maximum cumulative gain relative to a running minimum, has also been investigated probabilistically, particularly in terms of its relationship to drawdown; see for example Hadjiliadis and Vecer (2006), Pospisil et al (2009), andZhang andHadjiliadis (2010).…”
Section: Introductionmentioning
confidence: 99%
“…Grossman and Zhou (1993) considered an asset allocation problem subject to drawdown constraints; Cvitanic and Karatzas (1995) extended the same optimization problem to the multi-variate framework; Chekhlov et al (2003Chekhlov et al ( , 2005) developed a linear programming algorithm for a sample optimization of portfolio expected return subject to constraints on drawdown, which, in Krokhmal et al (2003), was numerically compared to shortfall optimzation with applications to hedge funds in mind; Carr et al (2011) introduced a new European style drawdown insurance contract and derivative-based drawdown hedging strategies; and most recently Cherney and Obloj (2013), Sekine (2013), Zhang et al (2013) and Zhang (2015) studied drawdown optimization and drawdown insurance under various stochastic modeling assumptions. reformulated the necessary optimality conditions for a portfolio optimization problem with drawdown in the form of the Capital Asset Pricing Model (CAPM), which is used to derive a notion of drawdown beta.…”
Section: Introductionmentioning
confidence: 99%
“…The probability that a drawdown precedes a drawup in a finite time-horizon was studied under drifted Brownian motions and simple random walks in [24]. More recently, Zhang [23] and Zhang and Hadjiliadis [25] studied Laplace transforms of the drawdown time, the so-called speed of market crash, and various occupation times at the first exit and the drawdown time for a general time-homogeneous diffusion process.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Zhang, Leung, and Hadjiliadis () introduced a drawdown insurance contract whereby the protection buyer pays a constant premium over time to insure against a drawdown of a prespecified amount, with features such as early cancellation and drawup contingencies. Zhang () studied the law of the occupation times of the drawdown and drawup processes and used the results to price cumulative Parisian options and α‐quantile options on the drawdown process. American options on maximum drawdown were also considered in the recent paper by Gapeev and Rodosthenous ().…”
Section: Introductionmentioning
confidence: 99%