A stochastically quasi-optimal search algorithm for the maximum of the simple random walk
type: Item
instance of: scholarly article
title: A stochastically quasi-optimal search algorithm for the maximum of the simple random walk
zbMATH Open document ID: 1084.68145
author: Philippe Chassaing
author: Jean-François Marckert
author: Marc Yor
published in: The Annals of Applied Probability
publication date: 2004-03-30T00:00:00Z
full work available at URL: https://projecteuclid.org/euclid.aoap/1069786499
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 60E15
Mathematics Subject Classification ID: 60F05
Mathematics Subject Classification ID: 60G50
Mathematics Subject Classification ID: 60J65
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2063739
zbMATH Keywords: Analysis of algorithms
zbMATH Keywords: searching
zbMATH Keywords: random walk
zbMATH Keywords: stochastic order
zbMATH Keywords: Brownian motion
MaRDI profile type: Publication
OpenAlex ID: W1999128627
cites work: Q4091421
cites work: Determining the majority
cites work: Optimal Search for a Maximum with Sequences of Simultaneous Function Evaluations
cites work: Q4289657
cites work: Q3756256
cites work: Q3816802
cites work: Probability laws related to the Jacobi theta and Riemann zeta functions, and Brownian excur\-sions
cites work: Q3682518
cites work: On the laws of homogeneous functionals of the Brownian bridge
cites work: Determining the majority: The biased case
cites work: How many probes are needed to compute the maximum of a random walk?
cites work: Q4524565
cites work: Excursions in Brownian motion
cites work: Average case selection
cites work: A Random Walk and a Wiener Process Near a Maximum
cites work: Functionals of Brownian meander and Brownian excursion
cites work: The average height of binary trees and other simple trees
cites work: Euler Sums and Contour Integral Representations
cites work: The Distribution of Heights of Binary Trees and Other Simple Trees
cites work: Locating the maximum of a simple random sequence by sequential search
cites work: A constant arising from the analysis of algorithms for determining the maximum of a random walk
cites work: Q3140448
cites work: The distribution of the maximum Brownian excursion
cites work: On the Random Walk and Brownian Motion
cites work: Brownian Local Times and Taboo Processes
cites work: Q4369384
cites work: Q3274495
cites work: Q3911794
cites work: Kac's formula, levy's local time and brownian excursion
cites work: Search for the maximum of a random walk
cites work: Q4896013
cites work: Path decompositions of a Brownian bridge related to the ratio of its maximum and amplitude
cites work: Noisy Information and Computational Complexity
cites work: Q4303982
cites work: Q4855565
cites work: A formula of S. Ramanujan
cites work: Honest bernoulli excursions
cites work: Q3321201
cites work: A bernoulli excursion and its various applications
cites work: Q4040428
cites work: A relation between Brownian bridge and Brownian excursion
cites work: Path Decomposition and Continuity of Local Time for One-Dimensional Diffusions, I
cites work: Q4187050
cites work: Random Search in the Presence of Noise, with Application to Machine Learning
DOI: 10.1214/AOAP/1069786499
description: scientific article; zbMATH DE number 2063739