Branching Technique for Markov Chain Simulation (Finite State Case)

摘要

The paper is devoted to the development of the known splitting and Russian roulette method for Markov chains simulation. Representations for variances of unbiased parameter estimates and optimal numbers for branching are obtained. Efficiency of the method applied to M/M/1 queueing system is estimated.