# Sorting by Swaps with Noisy Comparisons

12 Mar 2018Tomáš GavenčiakBarbara GeissmannJohannes Lengler

We study sorting of permutations by random swaps if each comparison gives the wrong result with some fixed probability $p<1/2$. We use this process as prototype for the behaviour of randomized, comparison-based optimization heuristics in the presence of noisy comparisons... (read more)

PDF Abstract