ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For every psilon>0psilon>0, there exists a constant Cpsilon<∞C_{psilon}<\infty such that, for every n\ngreaterthanorequalto1n\ngreater than or equal to 1 and every increasing set A≠∅A\not=\emptyset in 0,1n{0,1}^n satisfying mu(A)≥εmu(A)\geq \varepsilon, the lazy random walk on the Boolean cube censored to AA has mixing time tmix(PA)≤Cεnlog⁡nt_{\mathrm{mix}}(P_A)\leq C_{\varepsilon}n\log n. The cited preprint gives the more explicit bound tmix(PA)≤Kmu(A)−3nlog⁡(en)t_{\mathrm{mix}}(P_A)\leq Kmu(A)^{-3}n\log(en) for an absolute constant KK.

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.