How many probes are needed to compute the maximum of a random walk?-Reference-Cited by-同舟云学术

How many probes are needed to compute the maximum of a random walk?

Published:1999-05 Issue:1 Volume:81 Page:129-153
ISSN:0304-4149
Container-title:Stochastic Processes and their Applications
language:en
Short-container-title:Stochastic Processes and their Applications

Author:

Chassaing Philippe

Publisher

Elsevier BV

Subject

Applied Mathematics,Modeling and Simulation,Statistics and Probability

Reference22 articles.

1. Abramowitz, Stegun, 1984. Pocketbook of mathematical functions. Verlag Harri Deutsch, Thun.

2. Asmussen, S., 1987. Applied Probability and Queues. Wiley, Chichester.

3. An almost optimal algorithm for unbounded searching;Bentley;Inform. Process. Lett.,1976

4. Bollobas, B., 1985. Random Graphs. Academic Press, London.

5. Chassaing, P., Marckert, J.F., Yor, M., 1998. A stochastically quasi-optimal algorithm. Tech. Report no. 2, Institut Elie Cartan, Nancy, 1999. In preparation.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Normalized functionals of first passage Brownian motion and a curious connection with the maximal relative height of fluctuating interfaces;Journal of Physics A: Mathematical and Theoretical;2016-04-12

2. On Certain Functionals of the Maximum of Brownian Motion and Their Applications;Journal of Statistical Physics;2015-10-01

3. Monte Carlo Algorithms for Finding the Maximum of a Random Walk with Negative Drift;Journal of Applied Probability;2006-03

4. Monte Carlo Algorithms for Finding the Maximum of a Random Walk with Negative Drift;Journal of Applied Probability;2006-03