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…
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.