ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider a cycle of nn vertices and choose KK hubs randomly, where K∈Z+K\in\mathbb{Z}_+ and >0>0 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 nn, there is a positive bounded probability that

tmix(\f)=Θ(n1+1/K).t_{\rm mix}(\f)=\Theta\left(n^{1+1/K}\right).

This conjecture is motivated by a heuristic diffusion and central-limit estimate for the number of vertices reached by time nαn^\alpha, predicting the exponent alpha=1+1/Kalpha=1+1/K. 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 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.