ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Random walk on monotone subsets of {0,1}n\{0,1\}^n

Let A⊂{0,1}nA\subset \{0,1\}^n be a monotone subset of the hypercube: for all x∈Ax\in A, if yy satisfies yi≥xiy_i\geq x_i for all 1≤i≤n1\leq i\leq n, then y∈Ay\in A. The random walk picks a coordinate at random, flip it, and accepts the move only if it remains in AA.

Can we establish an upper bound in O(nlog⁡n)O(n\log n) for the mixing time ?

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.