Derandomization of Euclidean Random Walks [chapter]

Ilia Binder, Mark Braverman
2007 Lecture Notes in Computer Science  
We consider the problem of derandomizing random walks in the Euclidean space R k . We show that for k = 2, and in some cases in higher dimensions, such walks can be simulated in Logspace using only poly-logarithmically many truly random bits. As a corollary, we show that the Dirichlet Problem can be deterministically simulated in space O(log n √ log log n), where 1/n is the desired precision of the simulation.
doi:10.1007/978-3-540-74208-1_26 fatcat:p56crfbuf5dblkxsguavymlpzy