scholarly journals On a first hit distribution of the running maximum of Brownian motion

Author(s):  
Julien Randon-Furling ◽  
Paavo Salminen ◽  
Pierre Vallois
2014 ◽  
Vol 51 (03) ◽  
pp. 818-836 ◽  
Author(s):  
Luis H. R. Alvarez ◽  
Pekka Matomäki

We consider a class of optimal stopping problems involving both the running maximum as well as the prevailing state of a linear diffusion. Instead of tackling the problem directly via the standard free boundary approach, we take an alternative route and present a parameterized family of standard stopping problems of the underlying diffusion. We apply this family to delineate circumstances under which the original problem admits a unique, well-defined solution. We then develop a discretized approach resulting in a numerical algorithm for solving the considered class of stopping problems. We illustrate the use of the algorithm in both a geometric Brownian motion and a mean reverting diffusion setting.


2015 ◽  
Vol 47 (1) ◽  
pp. 210-230 ◽  
Author(s):  
Hongzhong Zhang

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 of Brownian motion with drift and three-dimensional Bessel processes, where we prove an identity in law.


2014 ◽  
Vol 51 (03) ◽  
pp. 818-836 ◽  
Author(s):  
Luis H. R. Alvarez ◽  
Pekka Matomäki

We consider a class of optimal stopping problems involving both the running maximum as well as the prevailing state of a linear diffusion. Instead of tackling the problem directly via the standard free boundary approach, we take an alternative route and present a parameterized family of standard stopping problems of the underlying diffusion. We apply this family to delineate circumstances under which the original problem admits a unique, well-defined solution. We then develop a discretized approach resulting in a numerical algorithm for solving the considered class of stopping problems. We illustrate the use of the algorithm in both a geometric Brownian motion and a mean reverting diffusion setting.


2015 ◽  
Vol 52 (1) ◽  
pp. 191-208 ◽  
Author(s):  
David Landriault ◽  
Bin Li ◽  
Hongzhong Zhang

Drawdowns measuring the decline in value from the historical running maxima over a given period of time are considered as extremal events from the standpoint of risk management. To date, research on the topic has mainly focused on the side of severity by studying the first drawdown over a certain prespecified size. In this paper we extend the discussion by investigating the frequency of drawdowns and some of their inherent characteristics. We consider two types of drawdown time sequences depending on whether a historical running maximum is reset or not. For each type we study the frequency rate of drawdowns, the Laplace transform of the nth drawdown time, the distribution of the running maximum, and the value process at the nth drawdown time, as well as some other quantities of interest. Interesting relationships between these two drawdown time sequences are also established. Finally, insurance policies protecting against the risk of frequent drawdowns are also proposed and priced.


Risks ◽  
2021 ◽  
Vol 9 (1) ◽  
pp. 17
Author(s):  
Leonie Violetta Brinker

Consider an insurance company whose surplus is modelled by an arithmetic Brownian motion of not necessarily positive drift. Additionally, the insurer has the possibility to invest in a stock modelled by a geometric Brownian motion independent of the surplus. Our key variable is the (absolute) drawdown Δ of the surplus X, defined as the distance to its running maximum X¯. Large, long-lasting drawdowns are unfavourable for the insurance company. We consider the stochastic optimisation problem of minimising the expected time that the drawdown is larger than a positive critical value (weighted by a discounting factor) under investment. A fixed-point argument is used to show that the value function is the unique solution to the Hamilton–Jacobi–Bellman equation related to the problem. It turns out that the optimal investment strategy is given by a piecewise monotone and continuously differentiable function of the current drawdown. Several numerical examples illustrate our findings.


2015 ◽  
Vol 52 (01) ◽  
pp. 191-208 ◽  
Author(s):  
David Landriault ◽  
Bin Li ◽  
Hongzhong Zhang

Drawdowns measuring the decline in value from the historical running maxima over a given period of time are considered as extremal events from the standpoint of risk management. To date, research on the topic has mainly focused on the side of severity by studying the first drawdown over a certain prespecified size. In this paper we extend the discussion by investigating the frequency of drawdowns and some of their inherent characteristics. We consider two types of drawdown time sequences depending on whether a historical running maximum is reset or not. For each type we study the frequency rate of drawdowns, the Laplace transform of the nth drawdown time, the distribution of the running maximum, and the value process at the nth drawdown time, as well as some other quantities of interest. Interesting relationships between these two drawdown time sequences are also established. Finally, insurance policies protecting against the risk of frequent drawdowns are also proposed and priced.


2014 ◽  
Vol 51 (3) ◽  
pp. 818-836 ◽  
Author(s):  
Luis H. R. Alvarez ◽  
Pekka Matomäki

We consider a class of optimal stopping problems involving both the running maximum as well as the prevailing state of a linear diffusion. Instead of tackling the problem directly via the standard free boundary approach, we take an alternative route and present a parameterized family of standard stopping problems of the underlying diffusion. We apply this family to delineate circumstances under which the original problem admits a unique, well-defined solution. We then develop a discretized approach resulting in a numerical algorithm for solving the considered class of stopping problems. We illustrate the use of the algorithm in both a geometric Brownian motion and a mean reverting diffusion setting.


2012 ◽  
Vol 2012 ◽  
pp. 1-12
Author(s):  
Yingdong Lu

We investigate the performance of a production system with correlated demand through diffusion approximation. The key performance metric under consideration is the extreme points that this system can reach. This problem is mapped to a problem of characterizing the joint probability density of a two-dimensional Brownian motion and its coordinate running maximum. To achieve this goal, we obtain the stationary distribution of a reflected Brownian motion within the positive quarter-plane, which is of independent interest, through investigating a solution of an extended Helmhotz equation.


2015 ◽  
Vol 47 (01) ◽  
pp. 210-230 ◽  
Author(s):  
Hongzhong Zhang

The drawdown process of a one-dimensional regular diffusion processXis given byXreflected at its running maximum. The drawup process is given byXreflected 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 of Brownian motion with drift and three-dimensional Bessel processes, where we prove an identity in law.


Sign in / Sign up

Export Citation Format

Share Document