Two-sided random walks conditioned to have no intersections

Abstract

Let S1,S2 be independent simple random walks in Zd (d=2,3) started at the origin. We construct two-sided random walk paths conditioned that S1[0,∞) S2[1, ∞) = .

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…