Answers are grounded in this paper and cite their sources.
Aldous and Fill asked whether every reversible Markov chain on n states, started from its stationary law, has expected cover time at least (n-1)Hₙ₋₁, the value for the simple random walk on the complete graph Kₙ. We prove this for $n=3$ and $n=4$, for all reversible chains including those with holding, and show that equality holds only for the simple random walk on Kₙ. The case $n=3$ reduces to Schur's inequality. The case $n=4$ rests on an explicit polynomial identity of degree $16$ whose numerator becomes coefficientwise nonnegative after an ordered substitution on each of $30$ cones of edge orderings. Holding is handled for every n by an occupation identity: if a chain without holding satisfies the bound and EᵢC≥ (n-1)Hₙ₋₁/2 for every state i, then the bound survives any added holding. This pointwise condition holds for n≤ 4.
No takes yet. Share an insight, caveat, or question.
Yitzchak Shmalo (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: