“…Furthermore, by the Perron-Frobenius theorem, this convergence occurs exponentially fast. Therefore, p n k provides an excellent approximation of p n for large k. All the prior works [16], [18], [50], [51], [53], [54], and [56] use this type of approximation to compute the quantity of interest 'exactly' to illustrate the numerical performance of the algorithms under consideration and we will do the same. For our numerical study, we set μ 1 = 0.4, μ 2 = 0.5, λ = 0.1, and n = 60.…”