A stochastically quasi-optimal search algorithm for the maximum of the simple random walk
Copyright policy )A stochastically quasi-optimal search algorithm for the maximum of the simple random walk
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], searching, stochastic order, Sums of independent random variables; random walks, 68P10, Analysis of algorithms and problem complexity, 68Q25, Central limit and other weak theorems, random walk, 60F17, 90B40, 60J65, Inequalities; stochastic orderings, Analysis of algorithms, Brownian motion
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], searching, stochastic order, Sums of independent random variables; random walks, 68P10, Analysis of algorithms and problem complexity, 68Q25, Central limit and other weak theorems, random walk, 60F17, 90B40, 60J65, Inequalities; stochastic orderings, Analysis of algorithms, Brownian motion
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!