Combinatorics for Processes
Part of the Applied Mathematical Sciences book series (AMS, volume 77)
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
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer Science+Business Media New York 1989