Win rates at first-passage times for biased simple random walks
Abstract
We study the win rate RNd/Nd of a biased simple random walk Sn on Z at the first-passage time Nd=∈f\n 0:Sn=d\, with p=P[X1=+1]∈[1/2,1). Using generating-function techniques and integral representations, we derive explicit formulas for the expectation and variance of RNd/Nd along with monotonicity properties in the threshold d and the bias p. We also provide closed-form expressions and use them to design unbiased coin-flipping estimators of π based on first-passage sampling; the resulting schemes illustrate how biasing the coin can dramatically improve both approximation accuracy and computational cost.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.