Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Deterministic Random ...
Conference paper

Deterministic Random Walks on the Integers

Joshua Cooper ORCID (1), Benjamin Doerr ORCID (2), Joel Spencer (1), Gábor Tardos ORCID (3)
(1) Courant Institute of Mathematical Sciences [New York]
(2) Max-Planck-Institut für Informatik
(3) Alfréd Rényi Institute of Mathematics
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2004
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Proceedings
DOI
10.46298/dmtcs.3436
License
https://about.hal.science/hal-authorisation-v1
National Science Foundation
0303272
PostDoctoral Research Fellowship
Indicators
599
Views
412
Downloads

Deterministic Random Walks on the Integers

Joshua Cooper ORCID (1), Benjamin Doerr ORCID (2), Joel Spencer (1), Gábor Tardos ORCID (3)
(1) Courant Institute of Mathematical Sciences [New York]
(2) Max-Planck-Institut für Informatik
(3) Alfréd Rényi Institute of Mathematics
Abstract
We analyze the one-dimensional version of Jim Propp's $P$-machine, a simple deterministic process that simulates a random walk on $\mathbb{Z}$. The "output'' of the machine is astonishingly close to the expected behavior of a random walk, even on long intervals of space and time.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • random walks
  • chip firing games.
Cited by

Source: OpenCitations

  • Rotor Walks on General Trees

    SIAM Journal on Discrete Mathematics

    Authors : Omer Angel ORCID, Alexander E. Holroyd ORCID

    Journal reference : Volume 25, 2011, pp. 423-446

    DOI : 10.1137/100814299
  • Rotor walks and Markov chains

    Contemporary mathematics - American Mathematical Society

    Authors : Alexander E. Holroyd ORCID, James Propp

    Journal reference : Volume , 2010, pp. 105-126

    DOI : 10.1090/conm/520/10256
  • Total variation discrepancy of deterministic random walks for ergodic Markov chains

    Theoretical Computer Science

    Authors : Takeharu Shiraga ORCID, Yukiko Yamauchi ORCID, Shuji Kijima ORCID, Masafumi Yamashita

    Journal reference : Volume 699, 2016, pp. 63-74

    DOI : 10.1016/j.tcs.2016.11.017
  • Deterministic Random Walks for Rapidly Mixing Chains

    SIAM Journal on Discrete Mathematics

    Authors : Takeharu Shiraga ORCID, Yukiko Yamauchi ORCID, Shuji Kijima ORCID, Masafumi Yamashita

    Journal reference : Volume 32, 2018, pp. 2180-2193

    DOI : 10.1137/16m1087667
  • L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains

    Lecture notes in computer science

    Authors : Takeharu Shiraga ORCID, Yukiko Yamauchi ORCID, Shuji Kijima ORCID, Masafumi Yamashita

    Journal reference : Volume , 2014, pp. 25-36

    DOI : 10.1007/978-3-319-08783-2_3
  • Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router

    Lecture notes in computer science

    Authors : Adrian Kosowski, Dominik Pająk ORCID

    Journal reference : Volume , 2014, pp. 544-555

    DOI : 10.1007/978-3-662-43951-7_46
  • Quasirandom Rumor Spreading

    ACM Transactions on Algorithms

    Authors : Benjamin Doerr, Tobias Friedrich ORCID, Thomas Sauerwald ORCID

    Journal reference : Volume 11, 2014, pp. 1-35

    DOI : 10.1145/2650185
  • Fast simulation of large‐scale growth models

    Random Structures and Algorithms

    Authors : Tobias Friedrich ORCID, Lionel Levine ORCID

    Journal reference : Volume 42, 2012, pp. 185-213

    DOI : 10.1002/rsa.20412
  • Unbounded Discrepancy of Deterministic Random Walks on Grids

    SIAM Journal on Discrete Mathematics

    Authors : Tobias Friedrich ORCID, Maximilian Katzmann ORCID, Anton Krohmer ORCID

    Journal reference : Volume 32, 2018, pp. 2441-2452

    DOI : 10.1137/17m1131088
  • Does adding more agents make a difference? A case study of cover time for the rotor-router

    Journal of Computer and System Sciences

    Authors : Adrian Kosowski, Dominik Pająk ORCID

    Journal reference : Volume 106, 2019, pp. 80-93

    DOI : 10.1016/j.jcss.2019.07.001
  • Proppian random walks in Z

    Discrete Mathematics

    Authors : Juliana Freire ORCID, Joel Spencer

    Journal reference : Volume 311, 2010, pp. 349-361

    DOI : 10.1016/j.disc.2010.11.001
  • Memory Efficient Anonymous Graph Exploration

    Lecture notes in computer science

    Authors : Leszek Gąsieniec ORCID, Tomasz Radzik ORCID

    Journal reference : Volume , 2008, pp. 14-29

    DOI : 10.1007/978-3-540-92248-3_2
  • Deterministic random walks on finite graphs

    Random Structures and Algorithms

    Authors : Shuji Kijima ORCID, Kentaro Koga, Kazuhisa Makino ORCID

    Journal reference : Volume 46, 2014, pp. 739-761

    DOI : 10.1002/rsa.20533
  • Parallel rotor walks on finite graphs and applications in discrete load balancing

    Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures

    Authors : Hoda Akbari ORCID, Petra Berenbrink ORCID

    Journal reference : Volume , 2013, pp. 186-195

    DOI : 10.1145/2486159.2486178
  • The cover time of deterministic random walks for general transition probabilities

    Theoretical Computer Science

    Authors : Takeharu Shiraga ORCID

    Journal reference : Volume 815, 2020, pp. 153-162

    DOI : 10.1016/j.tcs.2020.02.009
  • The Cover Time of Deterministic Random Walks

    Lecture notes in computer science

    Authors : Tobias Friedrich ORCID, Thomas Sauerwald ORCID

    Journal reference : Volume , 2010, pp. 130-139

    DOI : 10.1007/978-3-642-14031-0_16
  • Unbounded Discrepancy of Deterministic Random Walks on Grids

    Lecture notes in computer science

    Authors : Tobias Friedrich ORCID, Maximilian Katzmann ORCID, Anton Krohmer ORCID

    Journal reference : Volume , 2015, pp. 212-222

    DOI : 10.1007/978-3-662-48971-0_19
  • Deterministic walks with choice

    Discrete Applied Mathematics

    Authors : Katy E. Beeler, Kenneth S. Berenhaut ORCID, Joshua N. Cooper ORCID, Meagan N. Hunter, Peter S. Barr

    Journal reference : Volume 162, 2013, pp. 100-107

    DOI : 10.1016/j.dam.2013.08.031
  • Orbits of rotor-router operation and stationary distribution of random walks on directed graphs

    Advances in Applied Mathematics

    Authors : Trung Van Pham ORCID

    Journal reference : Volume 70, 2015, pp. 45-53

    DOI : 10.1016/j.aam.2015.06.006
  • A simple approach for adapting continuous load balancing processes to discrete settings

    Distributed Computing

    Authors : Hoda Akbari ORCID, Petra Berenbrink ORCID, Thomas Sauerwald ORCID

    Journal reference : Volume 29, 2016, pp. 143-161

    DOI : 10.1007/s00446-016-0266-y
  • Fast Simulation of Large-Scale Growth Models

    Lecture notes in computer science

    Authors : Tobias Friedrich ORCID, Lionel Levine ORCID

    Journal reference : Volume , 2011, pp. 555-566

    DOI : 10.1007/978-3-642-22935-0_47
  • Some basic properties of a rotor-router model with i.i.d. initial rotor-routers on the line

    Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications

    Authors : Yusuke Ide, Norio Konno ORCID, Masato Takei ORCID

    Journal reference : Volume 2014, 2014, pp. 303-306

    DOI : 10.5687/sss.2014.303
  • Discrete analog computing with rotor-routers

    arXiv (Cornell University)

    Authors : James Propp

    Journal reference : Volume 20, 2010, pp. 037110

    DOI : 10.1063/1.3489886
  • Deterministic Random Walks on Regular Trees

    arXiv (Cornell University)

    Authors : Joshua Cooper ORCID, Benjamin Doerr ORCID, Tobias Friedrich ORCID, Joel Spencer

    Journal reference : Volume 29, 2007, pp. 353-366

    DOI : 10.1002/rsa.20314
  • Randomness in algorithm design

    Journal of Physics Conference Series

    Authors : Shuji Kijima ORCID

    Journal reference : Volume 473, 2013, pp. 012014

    DOI : 10.1088/1742-6596/473/1/012014
  • Abelian networks IV. Dynamics of nonhalting networks

    arXiv (Cornell University)

    Authors : Swee Hong Chan, Lionel Levine ORCID

    Journal reference : Volume 276, 2022, pp.

    DOI : 10.1090/memo/1358
Preview
Loading PDF preview...