Random biased transpositions: two-class cutoff, parity repair, and heterogeneous product reductions
Statement
Random biased transpositions
The random uniform transposition walk on is the discrete time Markov chain that at each time step applies a transposition uniformly at random.
The random nearly-uniform (biased) transposition walk is the corresponding chain that at each time step applies a transposition with probability for comparable to the uniform rate up to uniformly bounded constants.
Does the random nearly-uniform transposition walk on exhibit cutoff?
What about in the simpler case where for each ?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.