Simulating a Random Walk with Constant Error

Details Simulating a Random Walk with Constant Error Simulating a Random Walk with Constant Error

2004-02-19

arxiv.org/abs/math/0402323v2

Mathematics

Combinatorics

8 Pages, 0 Figures

Scientific paper

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$.

Affiliated with

Also associated with

No associations

Rating

Simulating a Random Walk with Constant Error does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simulating a Random Walk with Constant Error, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simulating a Random Walk with Constant Error will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-709270