ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Random biased transpositions

The random uniform transposition walk on SnS_n is the discrete time Markov chain that at each time step applies a transposition (i,j)(i,j) uniformly at random.

The random nearly-uniform (biased) transposition walk is the corresponding chain that at each time step applies a transposition (i,j)(i,j) with probability pijp_{ij} for pijp_{ij} comparable to the uniform rate up to uniformly bounded constants.

Does the random nearly-uniform transposition walk on SnS_n exhibit cutoff?

What about in the simpler case where pij=pipjp_{ij}=p_{i}p_{j} for each 1≤i,j≤n1\leq i,j\leq n?

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.