Logarithmic reduction of the level of randomness in some probabilistic geometric constructions (Q2491601)

Many surprising and sometimes counter-intuitive phenomena in high-dimensional convex geometry are established using probabilistic arguments. Therefore they typically show the existence of certain geometric structures but do not yield explicit constructions. In this paper, the authors show that in many of these results the random steps can be replaced by explicit algorithmic steps. As the main tool, random walks on expander graphs are used.