47 search results - page 1 / 10 » Deterministic random walks on the integers |
84
Voted
EJC
2007
14 years 10 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...
WIA
2009
Springer
15 years 5 months ago
2009
Springer
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...
SODA
2008
ACM
15 years 4 days ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
COCOON
2010
Springer
15 years 1 months ago
2010
Springer
APPROX
2007
Springer
15 years 4 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...