ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Does the simple random walk on every family of vertex-transitive expander graphs exhibit total-variation cutoff, and can the comparison between the mixing times of the simple and non-backtracking random walks known for random regular graphs be extended to every such family?

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 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.