Proppian random walks in ℤ

Juliana Freire, Joel Spencer

Research output: Contribution to journalArticle

Abstract

The Propp Machine is a deterministic process that simulates a random walk. Instead of distributing chips randomly, each position makes the chips move according to the walk's possible steps in a fixed order. A random walk is called Proppian if at each time at each position the number of chips differs from the expected value by at most a constant, independent of time or the initial configuration of chips. The simple walk where the possible steps are 1 or -1 each with probability p=12 is Proppian, with constant approximately 2.29. The equivalent simple walks on Zd are also Proppian. Here, we show the same result for a larger class of walks on Z, allowing an arbitrary number of possible steps with some constraint on their probabilities.

Original language English (US) 349-361 13 Discrete Mathematics 311 5 https://doi.org/10.1016/j.disc.2010.11.001 Published - Mar 6 2011

Walk
Random walk
Chip
Expected Value
Configuration
Arbitrary

Keywords

• Derandomization
• Propp machine
• Random walk

ASJC Scopus subject areas

• Discrete Mathematics and Combinatorics
• Theoretical Computer Science

Cite this

Proppian random walks in ℤ. / Freire, Juliana; Spencer, Joel.

In: Discrete Mathematics, Vol. 311, No. 5, 06.03.2011, p. 349-361.

Research output: Contribution to journalArticle

Freire, Juliana ; Spencer, Joel. / Proppian random walks in ℤ. In: Discrete Mathematics. 2011 ; Vol. 311, No. 5. pp. 349-361.
@article{9f827e717eb745f5abddf63fa588d94f,
title = "Proppian random walks in ℤ",
abstract = "The Propp Machine is a deterministic process that simulates a random walk. Instead of distributing chips randomly, each position makes the chips move according to the walk's possible steps in a fixed order. A random walk is called Proppian if at each time at each position the number of chips differs from the expected value by at most a constant, independent of time or the initial configuration of chips. The simple walk where the possible steps are 1 or -1 each with probability p=12 is Proppian, with constant approximately 2.29. The equivalent simple walks on Zd are also Proppian. Here, we show the same result for a larger class of walks on Z, allowing an arbitrary number of possible steps with some constraint on their probabilities.",
keywords = "Derandomization, Propp machine, Random walk",
author = "Juliana Freire and Joel Spencer",
year = "2011",
month = "3",
day = "6",
doi = "10.1016/j.disc.2010.11.001",
language = "English (US)",
volume = "311",
pages = "349--361",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "5",

}

TY - JOUR

T1 - Proppian random walks in ℤ

AU - Freire, Juliana

AU - Spencer, Joel

PY - 2011/3/6

Y1 - 2011/3/6

N2 - The Propp Machine is a deterministic process that simulates a random walk. Instead of distributing chips randomly, each position makes the chips move according to the walk's possible steps in a fixed order. A random walk is called Proppian if at each time at each position the number of chips differs from the expected value by at most a constant, independent of time or the initial configuration of chips. The simple walk where the possible steps are 1 or -1 each with probability p=12 is Proppian, with constant approximately 2.29. The equivalent simple walks on Zd are also Proppian. Here, we show the same result for a larger class of walks on Z, allowing an arbitrary number of possible steps with some constraint on their probabilities.

AB - The Propp Machine is a deterministic process that simulates a random walk. Instead of distributing chips randomly, each position makes the chips move according to the walk's possible steps in a fixed order. A random walk is called Proppian if at each time at each position the number of chips differs from the expected value by at most a constant, independent of time or the initial configuration of chips. The simple walk where the possible steps are 1 or -1 each with probability p=12 is Proppian, with constant approximately 2.29. The equivalent simple walks on Zd are also Proppian. Here, we show the same result for a larger class of walks on Z, allowing an arbitrary number of possible steps with some constraint on their probabilities.

KW - Derandomization

KW - Propp machine

KW - Random walk

UR - http://www.scopus.com/inward/record.url?scp=79953784786&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79953784786&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2010.11.001

DO - 10.1016/j.disc.2010.11.001

M3 - Article

VL - 311

SP - 349

EP - 361

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 5

ER -