Equally spaced drifts maximize the speed of one-dimensional random walks

Consider random walks in environments on Z{\mathbb{Z}} composed of two types, (p,1p)(p,1-p) and (q,1q)(q,1-q), where 12<p<q<1\frac{1}{2}<p<q<1. Equally spaced drifts conjecture. An environment which maximizes the speed is given, up to some integer effect, by equally spaced drifts. The conjecture proposes the speed-maximizing arrangement for these two-point environments; the source does not state a resolution, so its status remains open.

Sources & referencesView supporting material

Primary source

Eviatar B. Procaccia and Ron Rosenthal, “The need for speed : Maximizing random walks speed on fixed environments”, arXiv:1109.0832 (2012).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.