Statistical mechanics of braided Markov chains: I. Analytic methods and numerical simulations

We investigate numerically and analytically the statistics of Markov chains on so-called braid (B _n ) and locally free (ℒℱ _n ) groups. Namely, we compute the mean length 〈μ〉 and the variance 〈μ²〉−〈μ〉² of the shortest word which remains after applying of all group relations to the randomly generatedN-letter word (Markov chain). We express the conjecture (numerically justified) that the mean value 〈μ〉 for the random walk on the groupB _n (n≫1) coincides with high accuracy with the same value for the random walk on the “locally free group weth errors” if the number of errors is of order of 20%.