Wilson's extremal mixing conjecture for random Cayley graphs
Statement
Let and diverge with , let be a group of order , and let . For fixed , write for the mixing time of the random walk on . Wilson's conjecture. If
then, with high probability,
Thus the random walk on is no slower than that on , up to lower-order terms. The paper proves the corresponding statement for Abelian groups, but the all-groups conjecture remains open.
Record
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.