Monte Carlo algorithms for finding the maximum of a random walk with negative drift

被引：0

作者：

Baringhaus, L ^{[1
]}

Grübel, R ^{[1
]}

机构：

[1] Leibniz Univ Hannover, Inst Math Stochast, D-30060 Hannover, Germany

来源：

JOURNAL OF APPLIED PROBABILITY | 2006年 / 43卷 / 01期

关键词：

Brownian motion with drift; conditioning; efficiency; fast Fourier transform; ladder variable; Markov chain; randomization;

D O I：

10.1239/jap/1143936244

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

We discuss two Monte Carlo algorithms for finding the global maximum of a simple random walk with negative drift. This problem can be used to connect the analysis of random input Monte Carlo algorithms with ideas and principles from mathematical statistics.

引用

页码：74 / 86

页数：13

共 50 条

[1] UPPER BOUNDS FOR THE MAXIMUM OF A RANDOM WALK WITH NEGATIVE DRIFT
Kugler, Johannes
Wachtel, Vitali
JOURNAL OF APPLIED PROBABILITY, 2013, 50 (04) : 1131 - 1146
[2] ON THE MAXIMUM OF A RANDOM-WALK WITH SMALL NEGATIVE DRIFT
KLASS, MJ
ANNALS OF PROBABILITY, 1983, 11 (03): : 491 - 505
[3] The overshoot of a random walk with negative drift
Tang, Qihe
STATISTICS & PROBABILITY LETTERS, 2007, 77 (02) : 158 - 165
[4] The maximum on a random time interval of a random walk with long-tailed increments and negative drift
Foss, S
Zachary, S
ANNALS OF APPLIED PROBABILITY, 2003, 13 (01): : 37 - 53
[5] SECOND ORDER APPROXIMATION FOR THE DISTRIBUTION OF THE MAXIMUM OF A RANDOM WALK WITH NEGATIVE DRIFT AND INFINITE VARIANCE
Borovkov, A. A.
THEORY OF PROBABILITY AND ITS APPLICATIONS, 2015, 59 (01) : 3 - 22
[6] Tail expansions for the distribution of the maximum of a random walk with negative drift and regularly varying increments
Barbe, Ph.
McCormick, W. P.
Zhang, C.
STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2007, 117 (12) : 1835 - 1847
[7] On the Value of derivative evaluations and random walk suppression in Markov Chain Monte Carlo algorithms
Gustafson, P
MacNab, YC
Wen, SJ
STATISTICS AND COMPUTING, 2004, 14 (01) : 23 - 38
[8] On the Value of derivative evaluations and random walk suppression in Markov Chain Monte Carlo algorithms
Paul Gustafson
Ying C. MacNab
Sijin Wen
Statistics and Computing, 2004, 14 : 23 - 38
[9] A CONDITIONAL RANDOM-WALK WITH A NEGATIVE DRIFT
AFANASEV, VI
THEORY OF PROBABILITY AND ITS APPLICATIONS, 1979, 24 (01) : 192 - 199
[10] Bound on the running maximum of a random walk with small drift
Busani, Ofer
Seppalainen, Timo
ALEA-LATIN AMERICAN JOURNAL OF PROBABILITY AND MATHEMATICAL STATISTICS, 2022, 19 (01): : 51 - 68

← 1 2 3 4 5 →