Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T14:43:52.618Z Has data issue: false hasContentIssue false

On the maximum drawdown of a Brownian motion

Published online by Cambridge University Press:  14 July 2016

Malik Magdon-Ismail*
Affiliation:
Rensselaer Polytechnic Institute
Amir F. Atiya*
Affiliation:
Cairo University
Amrit Pratap*
Affiliation:
Caltech, Pasadena
Yaser S. Abu-Mostafa*
Affiliation:
Caltech, Pasadena
*
∗ Postal address: Department of Computer Science, Rensselaer Polytechnic Institute, Room 207 Lally Building, 110 8th Street, Troy, NY 12180, USA. Email address: magdon@rpi.edu
∗∗ Postal address: Department of Computer Engineering, Cairo University, Giza, Egypt. Email address: amir@alumni.caltech.edu
∗∗∗ Postal address: Department of Computer Science, Caltech, MC 136-93, Pasadena, CA 91125, USA. Email address: apratap@caltech.edu
∗∗∗∗ Postal address: Department of Electrical Engineering and Department of Computer Science, Caltech, MC 136-93, Pasadena, CA 91125, USA. Email address: yaser@caltech.edu

Abstract

The maximum drawdown at time T of a random process on [0,T] can be defined informally as the largest drop from a peak to a trough. In this paper, we investigate the behaviour of this statistic for a Brownian motion with drift. In particular, we give an infinite series representation of its distribution and consider its expected value. When the drift is zero, we give an analytic expression for the expected value, and for nonzero drift, we give an infinite series representation. For all cases, we compute the limiting (T → ∞) behaviour, which can be logarithmic (for positive drift), square root (for zero drift) or linear (for negative drift).

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 2004 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable