• 検索結果がありません。

ON THE TIME OF THE MAXIMUM OF BROWNIAN MOTION

N/A
N/A
Protected

Academic year: 2022

シェア "ON THE TIME OF THE MAXIMUM OF BROWNIAN MOTION"

Copied!
7
0
0

読み込み中.... (全文を見る)

全文

(1)

ON THE TIME OF THE MAXIMUM OF BROWNIAN MOTION

WITH DRIFT

EMANNUEL BUFFET School of Mathematical Sciences

Dublin City University

Dublin 9, Ireland E–mail: [email protected]

(Received October, 2002; Revised March, 2003)

The distribution of the time at which Brownian motion with drift attains its maximum on a given interval is obtained by elementary methods. The proof depends on a remarkable integral identity involving Gaussian distribution functions.

Keywords: Brownian Motion with Drift, Girsanov’s Theorem, Integral Identity.

AMS (MOS) Subject Classification: 60J65, 60G17.

1 Introduction

The properties of the maximum value attained by Brownian motion on a given interval are well understood. Indeed, in the absence of drift, its distribution is easily obtained from the reflection principle; moreover the case of Brownian motion with drift can be reduced to the above through Girsanov’s theorem, using an appropriate change of probability measure, see Karatzas and Shreve [4], p. 196.

The time at which the maximum is attained is a less familiar and somewhat more subtle object. First one needs to prove that such a time is almost surely unique. So, if Bt,t≥0 is standard Brownian motion on a suitable probability space and if we denote its running maximum by

B¯t= max

0≤s≤tBs, then

θt= sup{s≤t :Bs= ¯Bt}= inf{s≤t :Bs= ¯Bt},

where the second equality holds almost surely, see Karatzas and Shreve [4], p. 102.

Next one can obtain the joint probability density of Bt, ¯Bt,θt: fBt,B¯tt(a, b, s) =

( b(b−a)

π(s(t−s))3/2e−(b−a)2/2(t−s)e−b2/2s ifba,b≥0,st,

0 otherwise. (1.1)

201

(2)

This can be established (with some effort) by completely elementary means using nothing more than the defining properties of the increments of Brownian motion, see Karatzas and Shreve [4], p. 101.

As a consequence of (1.1), the time of the maximum of standard Brownian motion on [0,t] follows an arcsine law, see Karatzas and Shreve [4], p. 102.

fθt(s) = 1 πp

s(ts), 0< s < t. (1.2) The formula that replaces (1.2) when a drift term is added to Bt is known, and is considerably more complex; it reads

fθ(µ)

t (s) = 2 1

sϕ(µ

s) +µΦ(µs)

× 1

tsϕ(µ

ts)µΦ(−µts)

, 0< s < t (1.3) whereϕand Φ denote the standard Gaussian density and distribution function respec- tively. The route through which (1.3) is identified as being the density of the time of the maximum of Brownian motion with drift is somewhat circuitous: that formula was in fact derived in Akahori [1] as the density ofAt, the time spent by Brownian motion with drift in (0,∞) up to instant t. This in turn is known to coincide with the density of θt in the presence of a drift because (Bt, At) and (Btt) have identical laws when µ= 0. This fact is offered as an observation in Karatzas and Shreve [4], p. 425 after both laws have been obtained separately; the derivation of the joint law of (Bt, At) involves excursion theory.

A probabilistic explanation for the above identity in law is given in Karatzas and Shreve [3] by means of path decomposition methods. Two alternative explanations are offered in Embrechts et al. [2]. One of these relies on the observation that both θt

andAt can be expressed in terms of hitting times of appropriate Brownian bridges; the other one depends on the properties of Brownian meanders.

To be sure, the articles described above provide a fascinating insight into fundamen- tal questions of stochastic analysis; but to someone primarily interested in (1.3), none of these approaches can be described as direct. Moreover, the level of sophistication required is considerable. By contrast, this article offers a direct and straightforward derivation of (1.3).

Remark 1.1: When comparing formula (1.3) to Theorem 1.1 in Akahori [1] the reader should note that what is actually calculated there is the distribution of the time spent in (−∞,0); also the author uses the notation Φ for the tail of the Gaussian distribution. Finally, (1.3) has the advantage of showing explicitly the invariance of fθ(µ)

t under the combined transformation,µ→ −µ,sts.

2 Changing measure

The most natural method for establishing formula (1.3) consists in reducing the prob- lem to a driftless one through a change of measure, exactly as is done when studying the distribution of the maximum value of Brownian motion. By Girsanov’s theorem

(3)

(Karatzas and Shreve [4], p. 196) if Bs, 0 ≤ st is standard Brownian motion on (Ω,F,P) thenWs=Bs+µsis itself standard Brownian motion on (Ω,F,Pµ) where

dPµ=e−µBt−µ2t/2dP, or equivalently

dP =eµWt−µ2t/2dPµ.

This results in the following identity for the probability densityfθ(µ)

t of the time of the maximum ofBs+µs, 0st:

fθ(µ)

t (s) =e−µ2t/2 Z

−∞

eµafBtt(a, s)da. (2.1) Hence our first task must be to extract fBtt from the trivariate density (1.1).

Although the calculation is straighforward, the result does not seem to appear in the standard treatises; neither is it particularly simple.

Proposition 2.1: The joint density of standard Brownian motion and the time of its maximum up to instant t is given for 0< s < t by

fBtt(a, s) = a πt2

r s

tse−a2/2s+ r2

π 1

t3/2e−a2/2t(1−a2 t )Φ(−a

rts st ) ifa≥0, and

fBtt(a, s) = −a πt2

rts

s e−a2/2(t−s)+ r2

π 1

t3/2e−a2/2t(1−a2 t )Φ(a

r s t(ts)) ifa≤0.

Proof: Clearly

fBtt(a, s) = Z

a+

fBt,B¯tt(a, b, s)db,

where a+ = max(a,0) denotes the positive part of a. The integration becomes easy if the exponent in (1.1) is written in the form

−1 2{a2

t +(b−as/t)2 σ2 },

withσ2=s(ts)/t. Standard manipulations lead to

fBtt(a, s) = e−a2/2t πtp

s(ts)(a+a+as

t )e−(a+−as/t)2/2σ2 +

r2 π

1

t3/2e−a2/2t(1−a2/t)Φ(−a+as/t

σ )

which is equivalent to the stated result.

(4)

The next step is to combine (2.1) and Proposition 2.1. This yields eµ2t/2fθ(µ)

t (s) = s

πt2p s(ts)

Z

0

eµaae−a2/2sda

+ r2

π 1 t3/2

Z

0

eµae−a2/2t(1−a2 t )Φ(−a

rts st )da

− 1 πt2

rts s

Z 0

−∞

eµaae−a2/2(t−s)da

+ r2

π 1 t3/2

Z 0

−∞

eµae−a2/2t(1−a2 t )Φ(a

r s

t(ts))da. (2.2) The first and third terms are easily integrated to give

1 πt2p

s(ts) h

s2+ (t−s)2+µ

2πs5/2eµ2s/2Φ(µ√ s)

−µ

2π(t−s)5/2eµ2(t−s)/2Φ(−µ√ ts)i

. (2.3) However, the other two terms do not appear to lend themselves to an explicit evaluation, so that we are left with a frustratingly untidy formula forfθ(µ)

t , a far cry from the compact (1.3). We develop in the next section an integral identity which resolves this conundrum.

3 The Key Integral Identity

Theorem 3.1: The following holds whenever α, β, µRandαβ >0:

Z

0

e−αβx2/2

e−µxΦ(−αx) +eµxΦ(−βx) dx

= r2π

αβeµ2/2αβΦ µ pβ(α+β)

!

Φ −µ

pα(α+β)

! .

Proof: Rewrite the integral as eµ2/2αβ

Z 0

e−αβ(x+µ/αβ)2/2Φ(−αx)dx+ Z

0

e−αβ(x−µ/αβ)2/2Φ(−βx)dx

=eµ2/2αβ (Z

µ αβ

eu

2 2 Φ(−u

rα β +µ

β) du

αβ + Z

µ αβ

eu

2 2 Φ(−u

rβ αµ

α)du )

= eµ2/2αβ

√2παβ (Z

µ αβ

du Z −u

α β+µβ

−∞

e−(u2+v2)/2dv

+ Z

µ αβ

du Z −u

β αµ

α

−∞

e−(u2+v2)/2dv )

. (3.1)

The two integrals in (3.1) are over the regionsAandB represented in Figure 1.

(5)

v

u µ/β

µ/

−µ/√ αβ αβ

θ

θ

B A

Figure 1: The regionsAandB.

v

−µ/√ u αβ

A0 B

Figure 2: The regionsA0 andB.

(6)

In the above the angleθis determined by cosθ=

s β

α+β, sinθ= r α

α+β. (3.2)

In the view of the symmetry of the integrand, the region A can be replaced by its reflectionA0 in the vertical axis, see Figure 2.

Finally one can take advantage of the invariance of the integrand under rotations to replace the region of integrationA0B byC characterised in Figure 3.

C

v

θ u

Figure 3: The regionC.

The apex of the regionC has coordinates (−µ/p

α(α+β), µ/p

β(α+β)),

see (3.2); the result follows by inspection in view of the shape of the region of integration.

The above identity is remarkable in that the two parts of the integrand are not separately capable of such an explicit integration; indeed the prospects for simplification look bleak until one realizes the orthogonality between the boundaries ofA0 andB.

Theorem 3.1 allows us to evaluate (2.2); indeed if we denote byI(α, β, µ) the integral in theorem 1, a moment’s reflection shows that the second and fourth terms in (2.2) are nothing but

r2 π

1 t32

( I

r s t(ts),

rts st , µ

!

−1 t

2

∂µ2I

r s t(ts),

rts st , µ

!)

. (3.3)

(7)

If suffices now to use (2.2), (2.3),(3.3) and Theorem 3.1 to obtain, after a routine regrouping of terms of a similiar nature:

Theorem 3.2: The probability density of the time of the maximum ofBs+µsover [0,t] is given by formula (1.3).

Acknowledgements: It is a pleasure to thank Olivier Fossati for discussions on the subject matter of this article and Brien Nolan for help with the diagrams.

References

[1] Akahori, J., Some formulae for a new type of path-dependent option,Ann. Applied Prob.

5(1995), 383–388.

[2] Embrechts, P., Rogers, L.C.G. and Yor, M., A proof of Dassios’ representation of the α-quantile of Brownian motion with drift,Ann. Applied Prob.5(1995), 757–767.

[3] Karatzas, I. and Shreve S.E., . A decomposition of the Brownian path,Statist. Probab.

Lett.5(1987), 87–94.

[4] Karatzas, I. and Shreve S.E.,Brownian Motion and Stochastic Calculus, Springer, New York 1988.

参照

関連したドキュメント

The Sieve of Eratosthenes has been recently extended by excluding the multiples of 2, 3, and 5 from the initial set, and finding the additive rules that give the positions of

In this paper we consider probability logic suitable for reasoning about conditional probability that is based on Kolmogorov’s approach, allowing the iterations of

A proper solution of the system (1) is said to be oscillatory if every component of this solution has a sequence of zeroes tending to + 1.. Otherwise the solution is said to

We study the existnece and cardinality of solutions of multilinear differ- ential equations giving upper bounds on the number of solutions.. KEY WOHDS

This follows directly from [3], on using inequality (3.7). Let be any constant in the range 2.. AFUWAPE, A.U., On the Convergence of Solutions of Certain Fourth-order Different-

Six years before the work at the Steklov Institute in Moscow began, the achievement of introducing a formulation that later became known as the general control problem was adduced

The Levi–Malcev theorem reduces the classification of all finite-dimensional Lie algebras over a field of characteristic zero to the following three subsequent problems: (1)

The problem considered here is to estimate the number of distinct elements n, that is the cardinality, of very large multisets of size N while using constant memory and doing only