English

Crossing paths in 2D Random Walks

Applications 2009-09-29 v1

Abstract

We investigate crossing path probabilities for two agents that move randomly in a bounded region of the plane or on a sphere (denoted RR). At each discrete time-step the agents move, independently, fixed distances d1d_1 and d2d_2 at angles that are uniformly distributed in (0,2π)(0,2\pi). If RR is large enough and the initial positions of the agents are uniformly distributed in RR, then the probability of paths crossing at the first time-step is close to 2d1d2/(πA[R]) 2d_1d_2/(\pi A[R]), where A[R]A[R] is the area of RR. Simulations suggest that the long-run rate at which paths cross is also close to 2d1d2/(πA[R])2d_1d_2/(\pi A[R]) (despite marked departures from uniformity and independence conditions needed for such a conclusion).

Cite

@article{arxiv.0712.1477,
  title  = {Crossing paths in 2D Random Walks},
  author = {Marc Artzrouni},
  journal= {arXiv preprint arXiv:0712.1477},
  year   = {2009}
}
R2 v1 2026-06-21T09:52:24.349Z