• Aucun résultat trouvé

The maximal drawdown of the Brownian meander

N/A
N/A
Protected

Academic year: 2021

Partager "The maximal drawdown of the Brownian meander"

Copied!
9
0
0

Texte intégral

(1)

HAL Id: hal-01301802

https://hal.archives-ouvertes.fr/hal-01301802

Submitted on 13 Apr 2016

HAL is a multi-disciplinary open access

archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

The maximal drawdown of the Brownian meander

Yueyun Hu, Zhan Shi, Marc Yor

To cite this version:

Yueyun Hu, Zhan Shi, Marc Yor. The maximal drawdown of the Brownian meander. Elec-tronic Communications in Probability, Institute of Mathematical Statistics (IMS), 2015, 20 (39), �10.1214/ECP.v20-3945�. �hal-01301802�

(2)

The maximal drawdown of the Brownian meander

by

Yueyun Hu, Zhan Shi and Marc Yor†

Universit´e Paris XIII, Universit´e Paris VI & Universit´e Paris VI

Summary. Motivated by evaluating the limiting distribution of ran-domly biased random walks on trees, we compute the exact value of a negative moment of the maximal drawdown of the standard Brow-nian meander.

Keywords. Brownian meander, Bessel process, maximal drawdown. 2010 Mathematics Subject Classification. 60J65.

1

Introduction

Let (X(t), t ∈ [0, 1]) be a random process. Its maximal drawdown on [0, 1] is defined by

X#(1) := sup s∈[0, 1]

[ X(s) − X(s)] ,

where X(s) := supu∈[0, s]X(u). There has been some recent research interest on the study of drawdowns from probabilistic point of view ([7], [8]) as well as applications in insurance and finance ([1], [2], [3], [10], [12]).

We are interested in the maximal drawdown m#(1) of the standard Brownian meander (m(t), t ∈ [0, 1]). Our motivation is the presence of the law of m#(1) in the limiting distribution of randomly biased random walks on supercritical Galton–Watson trees ([4]); in particular, the value of E(m#1(1)) is the normalizing constant in the density function of

(3)

this limiting distribution. The sole aim of the present note is to compute E( 1

m#(1)), which turns out to have a nice numerical value.

Let us first recall the definition of the Brownian meander. Let W := (W (t), t ∈ [0, 1]) be a standard Brownian motion, and let g := sup{t ≤ 1 : W (t) = 0} be the last passage time at 0 before time 1. Since g < 1 a.s., we can define

m(s) := |W (g + s(1 − g))|

(1 − g)1/2 , s∈ [0, 1] .

The law of (m(s), s ∈ [0, 1]) is called the law of the standard Brownian meander. For an account of general properties of the Brownian meander, see Yen and Yor [11].

Theorem 1.1. Let (m(s), s ∈ [0, 1]) be a standard Brownian meander. We have

(1.1) E 1 sups∈[0, 1][ m(s) − m(s)]  =π 2 1/2 ,

where m(s) := supu∈[0, s]m(u).

The theorem is proved in Section 2.

We are grateful to an anonymous referee for a careful reading of the manuscript and for many suggestions for improvements.

N.B. from the first-named coauthors: This note originates from a question we asked our teacher, Professor Marc Yor (1949–2014), who passed away in January 2014, during the preparation of this note. He provided us, in November 2012, with the essential of the material in Section 2.

2

Proof

Let R := (R(t), t ≥ 0) be a three-dimensional Bessel process with R(0) = 0, i.e., the Eu-clidean modulus of a standard three-dimensional Brownian motion. The proof of Theorem 1.1 relies on an absolute continuity relation between (m(s), s ∈ [0, 1]) and (R(s), s ∈ [0, 1]), recalled as follows.

Fact 2.1. (Imhof [5]) Let (m(s), s ∈ [0, 1]) be a standard Brownian meander. Let (R(s), s ∈ [0, 1]) be a three-dimensional Bessel process with R(0) = 0. For any measurable and non-negative functional F , we have

E h F(m(s), s ∈ [0, 1])i=π 2 1/2 E h 1 R(1)F(R(s), s ∈ [0, 1]) i .

(4)

We now proceed to the proof of Theorem 1.1. Let L:= E 1

sups∈[0, 1][ m(s) − m(s)] 

.

Write R(t) := supu∈[0, t]R(u) for t ≥ 0. By Fact 2.1, L = π 2 1/2 Eh 1 R(1) 1 sups∈[0, 1][ R(s) − R(s)] i = π 2 1/2 Z ∞ 0 Eh 1 R(1)1{sups∈[0, 1][ R(s)−R(s)]<1a} i da ,

the last equality following from the Fubini–Tonelli theorem. By the scaling property, E[R(1)1 1{sup

s∈[0, 1][ R(s)−R(s)]<a1}] = E[

a

R(a2)1{supu∈[0, a2][ R(u)−R(u)]<1}] for all a > 0. So by means of a change of variables b = a2, we obtain:

L=π 8

1/2 Z ∞ 0

Eh 1

R(b)1{supu∈[0, b][ R(u)−R(u)]<1}

i db . Define, for any random process X,

τ1X := inf{t ≥ 0 : X(t) − X(t) ≥ 1} ,

with X(t) := sups∈[0, t]X(s). For any b > 0, the event {supu∈[0, b][ R(u) − R(u)] < 1} means {τR 1 > b}, so L=π 8 1/2 Z ∞ 0 Eh 1 R(b)1{τ1R>b} i db =π 8 1/2 E Z τ1R 0 1 R(b)db  ,

the second identity following from the Fubini–Tonelli theorem. According to a relation between Bessel processes of dimensions three and four (Revuz and Yor [9], Proposition XI.1.11, applied to the parameters p = q = 2 and ν = 12),

R(t) = U1 4 Z t 0 1 R(b)db  , t≥ 0 ,

where U := (U(s), s ≥ 0) is a four-dimensional squared Bessel process with U(0) = 0; in other words, U is the square of the Euclidean modulus of a standard four-dimensional Brownian motion.

Let us introduce the increasing functional σ(t) := 1 4 Rt 0 1 R(b)db, t ≥ 0. We have R = U ◦σ, and τ1R = inf{t ≥ 0 : R(t) − R(t) ≥ 1} = inf{t ≥ 0 : U (σ(t)) − U(σ(t)) ≥ 1} = inf{σ−1(s) : s ≥ 0 and U (s) − U(s) ≥ 1}

(5)

which is σ−1U 1 ). So τ1U = σ(τ1R), i.e., Z τ1R 0 1 R(b)db = 4τ U 1 ,

which implies that

L= (2π)1/2E(τ1U) . The Laplace transform of τU

1 is determined by Lehoczky [6], from which, however, it does not seem obvious to deduce the value of E(τU

1 ). Instead of using Lehoczky’s result directly, we rather apply his method to compute E(τU

1 ). By Itˆo’s formula, (U(t) −4t, t ≥ 0) is a continuous martingale, with quadratic variation 4Rt

0 U(s) ds; so applying the Dambis– Dubins–Schwarz theorem (Revuz and Yor [9], Theorem V.1.6) to (U(t) − 4t, t ≥ 0) yields the existence of a standard Brownian motion B = (B(t), t ≥ 0) such that

U(t) = 2B( Z t 0 U(s) ds) + 4t , t≥ 0 . Taking t := τU 1 , we get U(τ1U) = 2B( Z τ1U 0 U(s) ds) + 4τ1U. We claim that (2.1) EhB( Z τ1U 0 U(s) ds)i= 0 . Then E(τU 1 ) = 14E[U(τ U 1 )]; hence (2.2) L= (2π)1/2E(τ1U) = ( π 8) 1/2 E[U(τ1U)] .

Let us admit (2.1) for the moment, and prove the theorem by computing E[U(τU

1 )] using Lehoczky [6]’s method; in fact, we determine the law of U(τU

1 ). Lemma 2.2. The law of U(τU

1 ) is given by

P{U(τ1U) > a} = (a + 1)e−a, ∀a > 0. In particular, E[U(τ1U)] = Z ∞ 0 (a + 1)e−ada = 2. Since L = (π 8) 1/2E[U(τU

1 )] (see (2.2)), this yields L = (π2)

(6)

The rest of the note is devoted to the proof of Lemma 2.2 and (2.1).

Proof of Lemma 2.2. Fix b > 1. We compute the probability P{U(τ1U) > b} which, due to the equality U (τU

1 ) = U(τ1U) + 1, coincides with P{U(τ1U) > b − 1}. By applying the strong Markov property at time σU

0 := inf{t ≥ 0 : U(t) = 1}, we see that the value of P{U(τ1U) > b} does not change if the squared Bessel process U starts at U(0) = 1. Indeed, observing that σU

0 ≤ τ1U, U(σ0U) = 1 and that U (τ1U) = sups∈[σU

0, τ1U]U(s), we have P{U(τ1U) > b} = P n sup s∈[σU 0, τ1U] U(s) > bo= P1{U (τ1U) > b} ,

the subscript 1 in P1 indicating the initial value of U. More generally, for x ≥ 0, we write Px(•) := P(• | U(0) = x); so P = P0.

Let b0 = 1 < b1 < · · · < bn := b be a subdivision of [1, b] such that max1≤i≤n(bi − bi−1) → 0, n → ∞. Consider the event {U(τU

1 ) > b}: since U(0) = 1, this means U hits position b before time τU

1 ; for all i ∈ [1, n − 1] ∩ Z, starting from position bi, U must hit bi+1 before hitting bi − 1 (caution: not to be confused with bi−1). More precisely, let σiU := inf{t ≥ 0 : U(t) = bi} and let Ui(s) := U(s + σiU), s ≥ 0; then

{U(τ1U) > b} ⊂ n−1

\ i=1

{Ui hits bi+1 before hitting bi− 1} .

By the strong Markov property, the events {Ui hits bi+1 before hitting bi− 1}, 1 ≤ i ≤ n− 1, are independent (caution : the processes (Ui(s), s ≥ 0), 1 ≤ i ≤ n − 1, are not independent). Hence (2.3) P1{U(τU 1 ) > b} ≤ n−1 Y i=1

Pbi{U hits bi+1 before hitting bi− 1} .

Conversely, let ε > 0, and if max1≤i≤n(bi− bi−1) < ε, then we also have P1{U(τ1+εU ) > b} ≥

n−1 Y i=1

Pbi{U hits bi+1 before hitting bi− 1} ,

with τU

1+ε := inf{t ≥ 0 : U (t)−U(t) ≥ 1+ε}. By scaling, U (τ1+εU ) has the same distribution as (1 + ε)U(τ1U). So, as long as max1≤i≤n(bi− bi−1) < ε, we have

P1{U(τ1U) > b} ≤ n−1 Y i=1

Pbi{U hits bi+1 before hitting bi− 1} ≤ P1{U (τ

U 1 ) >

b 1 + ε} .

(7)

Since 1

x is a scale function for U, we have

Pbi{U hits bi+1 before hitting bi− 1} =

1 bi−1 − 1 bi 1 bi−1 − 1 bi+1 = 1 − 1 bi − 1 bi+1 1 bi−1 − 1 bi+1 .

If limn→∞max0≤i≤n−1(bi+1− bi) = 0, then for n → ∞, n−1 X i=1 1 bi − 1 bi+1 1 bi−1 − 1 bi+1 = n−1 X i=1 bi − 1 bi

(bi+1− bi) + o(1) → Z b 1 r− 1 r dr = b − 1 − log b . Therefore, lim n→∞ n−1 Y i=1

Pbi{U hits bi+1 before hitting bi− 1} = e

−(b−1−log b) = b e−(b−1).

Consequently,

P{U(τ1U) > b} = b e−(b−1), ∀b > 1. We have already noted that U(τU

1 ) = U(τ1U) − 1. This completes the proof of Lemma 2.2. 

Proof of (2.1). The Brownian motion B being the Dambis–Dubins–Schwarz Brownian motion associated with the continuous martingale (U(t)−4t, t ≥ 0), it is a (Gr)r≥0-Brownian motion (Revuz and Yor [9], Theorem V.1.6), where, for r ≥ 0,

Gr:= FC(r), C(r) := A−1(r), A(t) := Z t

0

U(s) ds ,

and A−1 denotes the inverse of A. [We mention that FC(r) is well defined because C(r) is an (Ft)t≥0-stopping time.] As such,

Z τ1U 0

U(s) ds = A(τ1U) . For all r ≥ 0, {A(τU

1 ) > r} = {τ1U > C(r)} ∈ FC(r)= Gr (observing that τ1U is an (Ft)t≥0-stopping time), which means that A(τU

1 ) is a (Gr)r≥0-stopping time. If A(τ1U) = Rτ1U

0 U(s) ds has a finite expectation, then we are entitled to apply the (first) Wald identity to see that E[B(A(τ1U))] = 0 as claimed in (2.1).

(8)

It remains to prove that E[A(τU

1 )] < ∞.

Recall that U is the square of the Euclidean modulus of an R4-valued Brownian motion. By considering only the first coordinate of this Brownian motion, say β, we have

P n sup s∈[0, a] U(s) < a1−εo≤ Pn sup s∈[0, a] |β(s)| < a(1−ε)/2o= Pn sup s∈[0, 1] |β(s)| < a−ε/2o; so by the small ball probability for Brownian motion, we obtain:

P n

sup s∈[0, a]

U(s) < a1−εo≤ exp(−c1aε) ,

for all a ≥ 1 et all ε ∈ (0, 1), with some constant c1 = c1(ε) > 0. On the event {sups∈[0, a]U(s) ≥ a1−ε}, if τU

1 > a, then for all i ∈ [1, a1−ε− 1] ∩ Z, the squared Bessel process U, starting from i, must first hit position i + 1 before hitting i − 1 (which, for each i, can be realized with probability ≤ 1 − c2, where c2 ∈ (0, 1) is a constant that does not depend on i, nor on a). Accordingly,1

Pn sup s∈[0, a]

U(s) ≥ a1−ε, τ1U > ao≤ (1 − c2)⌊a1−ε−1⌋ ≤ exp(−c3a1−ε) ,

with some constant c3 >0, uniformly in a ≥ 2. We have thus proved that for all a ≥ 2 and all ε ∈ (0, 1),

P{τ1U > a} ≤ exp(−c3a1−ε) + exp(−c1aε). Taking ε := 1

2, we see that there exists a constant c4 >0 such that P{τ1U > a} ≤ exp(−c4a1/2), ∀a ≥ 2.

On the other hand, U being a squared Bessel process, we have, for all a > 0 and all b ≥ a2, P{A(a) ≥ b} = P{A(1) ≥ b a2} ≤ P n sup s∈[0, 1] U(s) ≥ b a2 o ≤ e−c5b/a2,

for some constant c5 >0. Hence, for b ≥ a2 and a ≥ 2,

P{A(τ1U) ≥ b} ≤ P{τ1U > a} + P{A(a) ≥ b} ≤ exp(−c4a1/2) + e−c5b/a

2

.

Taking a := b2/5 gives that

P{A(τ1U) ≥ b} ≤ exp(−c6b1/5) , for some constant c6 >0 and all b ≥ 4. In particular, E[A(τU

1 )] < ∞ as desired. 

(9)

References

[1] Carraro, L., El Karoui, N. and Ob l´oj, J. (2012). On Az´ema-Yor processes, their optimal properties and the Bachelier-drawdown equation. Ann. Probab. 40, 372–400.

[2] Cheridito, P., Nikeghbali, A. and Platen, E. (2012). Processes of class sigma, last passage times, and drawdowns. SIAM J. Financial Math. 3, 280–303.

[3] Cherny, V. and Ob l´oj, J. (2013). Portfolio optimisation under non-linear drawdown constraints in a semimartingale financial model. Finance Stoch. 17, 771–800.

[4] Hu, Y. and Shi, Z. (2015+). The slow regime of randomly biased walks on trees. arXiv:1501.07700

[5] Imhof, J.-P. (1984). Density factorizations for Brownian motion, meander and the three-dimensional Bessel process, and applications. J. Appl. Probab. 21, 500–510. [6] Lehoczky, J.P. (1977). Formulas for stopped diffusion processes with stopping times

based on the maximum. Ann. Probab. 5, 601–607.

[7] Mijatovi´c, A. and Pistorius, M.R. (2012). On the drawdown of completely asymmetric L´evy processes. Stoch. Proc. Appl. 122, 3812–3836.

[8] Nikeghbali, A. (2006). A class of remarkable submartingales. Stoch. Proc. Appl. 116, 917–938.

[9] Revuz, D. and Yor, M. (1999). Continuous Martingales and Brownian Motion. (Third edition). Springer, Berlin.

[10] Rieder, U. and Wittlinger, M. (2014). On optimal terminal wealth problems with random trading times and drawdown constraints. Adv. Appl. Probab. 46, 121–138. [11] Yen, J.-Y. and Yor, M. (2013). Local Times and Excursion Theory for Brownian

Motion. A Tale of Wiener and Itˆo Measures. Lecture Notes in Mathematics 2088. Springer, Berlin.

[12] Zhang, H. and Hadjiliadis, O. (2012). Drawdowns and the speed of market crash. Methodol. Comput. Appl. Probab. 12, 293–308.

Yueyun Hu Zhan Shi Marc Yor†

D´epartement de Math´ematiques LPMA, Case 188 LPMA, Case 188 & IUF Universit´e Paris XIII Universit´e Paris VI Universit´e Paris VI 99 avenue J-B Cl´ement 4 place Jussieu 4 place Jussieu

F-93430 Villetaneuse F-75252 Paris Cedex 05 F-75252 Paris Cedex 05

France France France

Références

Documents relatifs

Biased random walk on the Galton–Watson tree, branching random walk, slow movement, random walk in a random environment, potential energy.. 2010 Mathematics

We were able to obtain the asymptotic of the maximal displacement up to a term of order 1 by choosing a bended boundary for the study of the branching random walk, a method already

This is in contrast with the one-dimensional case, and provides, to the best of our knowledge, the first non-trivial example of null recurrent random walk whose most visited sites

This stronger assumption is necessary and suffi- cient to obtain the asymptotic behaviour of many quantities associated to the branching random walk, such as the minimal

In Section 4, using coupling, we obtain heat kernel estimates, which is later used in Section 5 to show the uniqueness of the non-zero limiting velocity.. Throughout the paper,

Proof of Claim L — In graph C, at each of x vertices there are at least k edges. Also there are at least two edges at each of the vertices p, q and w. — In graph D, at each of

Maximal local time of randomly biased random walks on a Galton-Watson tree.. Xinxin Chen, Loïc

We say that a specific pattern M occurs in a tree T if M occurs in T as an induced subtree in the sense that the node degrees for the internal (filled) nodes in the pattern match