摘要: Given a nite group G, we study some aspects of probabilistic algorithms of the form: r:= 1 repeat choose g 2 G with probability p (g) r:= r: g until the probability distribution of r is close to uniform where p: G?! 0; 1] is a probability distribution on G. We are also interested in some questions such as the explicit computation of the probability of obtaining some element g 2 G after n iterations of the loop. This study is clearly equivalent to the computation of successive powers, in the group algebra A (G) of G, of=
参考文章(0)