Expected number of inversions after a sequence of random adjacent   transpositions
  In the evolution of a genome, the gene sequence is sometimes rearranged, for example by transposition of two adjacent gene blocks. In biocombinatorics, one tries to reconstruct these rearrangement incidents from the resulting permutation. It seems that the algorithms used are too effective and find a shorter path than the real one. For the simplified case of adjacent transpositions, we give expressions for the expected number of inversions after t random moves. This average can be much smaller than t, a fact that has largely been neglected so far. 
Henrik Eriksson, Kimmo Eriksson and Jonas Sjostrand