Conjecture on mixing time with a fixed number of random hubs
Statement
Consider a cycle of vertices and choose hubs randomly, where and are fixed. Equip the hubs with an appropriate interconnection structure, and consider a Markov chain otherwise analogous to the one studied in the paper. Hub mixing-time conjecture. For all sufficiently large , there is a positive bounded probability that
This conjecture is motivated by a heuristic diffusion and central-limit estimate for the number of vertices reached by time , predicting the exponent . The claim concerns a positive bounded probability over the random choice of hubs; its resolution is not established in the supplied text.
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.