• Title of article

    Proppian random walks in

  • Author/Authors

    Freire، نويسنده , , Juliana and Spencer، نويسنده , , Joel، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2011
  • Pages
    13
  • From page
    349
  • To page
    361
  • 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. mple walk where the possible steps are 1 or − 1 each with probability p = 1 2 is Proppian, with constant approximately 2.29. The equivalent simple walks on Z d 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
    Propp machine , random walk , derandomization
  • Journal title
    Discrete Mathematics
  • Serial Year
    2011
  • Journal title
    Discrete Mathematics
  • Record number

    1599575