Combinatorics for Processes
In this chapter we study analogues of the birthday problem, the matching problem and the coupon-collector’s problem for finite-valued stochastic processes (X n ; n ≥ 1) more complicated than i.i.d.
KeywordsRandom Walk Covering Problem Simple Random Walk Local Match Stationary Markov Chain
Unable to display preview. Download preview PDF.