Simulating a Random Walk with Constant Error

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We analyze Jim Propp's P-machine, a simple deterministic process that simulates a random walk on $Z^d$ to within a constant. The proof of the error bound relies on several estimates in the theory of simple random walks and some careful summing. We mention three intriguing conjectures concerning sign-changes and unimodality of functions in the linear span of $\{p(\cdot,x) : x \in Z^d\}$, where $p(n,x)$ is the probability that a walk beginning from the origin arrives at $x$ at time $n$.
8 Pages, 0 Figures

Keywords

Combinatorics, Probability, 82B41; 60G50

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/70225

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0402323
 http://arxiv.org/abs/math/0402323

Collections

arXiv