Aldous’s mixing-time conjecture for the cladogram chain
Statement
For each , let be the set of unrooted binary trees with leaves labelled by . Consider the Markov chain that, at each step, removes a uniformly random leaf, suppresses the resulting degree-two vertex, and reattaches the leaf by subdividing a uniformly random edge. Aldous's conjecture is that the total-variation mixing time of this chain satisfies ; equivalently, there exist constants and such that for all .
Record
- Added
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.