13 search results - page 1 / 3 » Derandomization of Euclidean Random Walks |
83
Voted
APPROX
2007
Springer
15 years 7 months ago
2007
Springer
We consider the problem of derandomizing random walks in the Euclidean space Rk . We show that for k = 2, and in some cases in higher dimensions, such walks can be simulated in Lo...
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
133
click to vote
STOC
1989
ACM
15 years 5 months ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
112
click to vote
ECCC
2006
15 years 1 months ago
2006
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
103
click to vote
EJC
2007
15 years 1 months ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...