Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-19T02:50:01.134Z Has data issue: false hasContentIssue false

On the number of times where a simple random walk reaches its maximum

Published online by Cambridge University Press:  14 July 2016

W. Katzenbeisser*
Affiliation:
University of Economics, Vienna
W. Panny*
Affiliation:
University of Economics, Vienna
*
∗ Postal address: Department of Statistics, University of Economics, Augasse 2-6, A-1090 Vienna, Austria.
∗∗ Postal address: Department of Computer Science, University of Economics, Augasse 2-6, A-1090 Vienna, Austria.

Abstract

Let Qn denote the number of times where a simple random walk reaches its maximum, where the random walk starts at the origin and returns to the origin after 2n steps. Such random walks play an important role in probability and statistics. In this paper the distribution and the moments of Qn , are considered and their asymptotic behavior is studied.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1992 

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