Simulating a Random Walk with Constant Error

Simple item page
dc.creatorCooper, Joshua N.
dc.creatorSpencer, Joel
dc.date2004-02-19
dc.date2004-04-12
dc.date.accessioned2026-07-07T05:05:36Z
dc.date.available2026-07-07T05:05:36Z
dc.descriptionWe 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$.
dc.description8 Pages, 0 Figures
dc.identifierhttps://arxiv.org/abs/math/0402323
dc.identifierhttp://arxiv.org/abs/math/0402323
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/70225
dc.subjectCombinatorics
dc.subjectProbability
dc.subject82B41; 60G50
dc.titleSimulating a Random Walk with Constant Error
dc.typetext

Files

Collections

arXiv