ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each n≥3n\ge 3, let Cn\mathcal{C}_n be the set of unrooted binary trees with leaves labelled by {1,…,n}\{1,\ldots,n\}. 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 tmix(n)t_{\mathrm{mix}}(n) of this chain satisfies tmix(n)=Θ(n2)t_{\mathrm{mix}}(n)=\Theta(n^2); equivalently, there exist constants 0<c<C<∞0<c<C<\infty and n0n_0 such that cn2≤tmix(n)≤Cn2c n^2\le t_{\mathrm{mix}}(n)\le C n^2 for all n≥n0n\ge n_0.

Record

Added
Links

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.