Logarithmic reduction of the level of randomness in some probabilistic geometric constructions

From MaRDI portal
Publication:2491601





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.



Cites work









This page was built for publication: Logarithmic reduction of the level of randomness in some probabilistic geometric constructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491601)