#34 Cycle walk variant on splittable trees
Statement
Suppose we run the up-down walk but restrict to trees that are k-splittable. Is this Markov chain ergodic, and if so, does it mix rapidly?
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.