#### Filter Results:

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Markov chains defined on the set of permutations of 1, 2,. .. , n have been studied widely by mathematicians and theoretical computer scientists [4, 1, 7, 15]. We consider chains in which a position i < n is chosen uniformly at random, and then σ(i) and σ(i+1) are swapped with probability depending on σ(i) and σ(i+1). Our objective is to identify some… (More)

- ‹
- 1
- ›