The Construction of Two Kinds of Bijections in Simple Random Walk Paths

It is known that for the 2n -step symmetric simple random walk on \mathbbZ , two events have the same probability if and only if their sets of paths have the same cardinality. In this article, we construct two kinds of bijections between sets of paths with the same cardinality. The construction is natural and simple, and it can be easily implemented via programming. More importantly, this construction opens a door to proving that two events in the 2n -step symmetric simple random walk on \mathbbZ have the same probability and some further related results.