Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-26T16:03:38.145Z Has data issue: false hasContentIssue false
  • English
  • Français

The higher moments of the number of returns of a simple random walk

Published online by Cambridge University Press:  01 July 2016

Peter Kirschenhofer  and
Helmut Prodinger
Peter Kirschenhofer*
Affiliation:
Technical University of Vienna
Helmut Prodinger*
Affiliation:
Technical University of Vienna
*
* Postal address: Department of Algebra and Discrete Mathematics, Wiedner Hauptstr. 8–10/118, Technical University of Vienna, A-1040 Wien, Austria.
* Postal address: Department of Algebra and Discrete Mathematics, Wiedner Hauptstr. 8–10/118, Technical University of Vienna, A-1040 Wien, Austria.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We consider a simple random walk starting at 0 and leading to 0 after 2n steps. By a generating functions approach we achieve closed formulae for the moments of the random variables ‘number of visits to the origin'.

Keywords

GENERATING FUNCTIONSCATALAN NUMBERS
Type
Letter to the Editor
Information
Advances in Applied Probability , Volume 26 , Issue 2 , June 1994 , pp. 561 - 563
Copyright
Copyright © Applied Probability Trust 1994 

References

[1] Flajolet, P. and Odlyzko, A. (1990) Singularity analysis of generating functions. SIAM J. Discrete Math. 3, 216–240.Google Scholar
[2] Katzenbeisser, W. and Panny, W. (1986) A note on the higher moments of the random variables associated with the number of returns of a simple random walk. Adv. Appl. Prob. 18, 279–282.Google Scholar
[3] Katzenbeisser, W. and Panny, W. (1992) On the number of times where a simple random walk reaches its maximum. J. Appl. Prob. 29, 305–312.Google Scholar
[4] Kemp, A. W. (1987) The moments of the random variable for the number of returns of a simple random walk. Adv. Appl. Prob. 19, 505–507.Google Scholar
[5] Kemp, R. (1990) On the number of deepest nodes in ordered trees. Discrete Math. 81, 247–258.CrossRefGoogle Scholar