Time-convention audit and an exact bottleneck for monotone censored cube walks
Statement
Random walk on monotone subsets of
Let be a monotone subset of the hypercube: for all , if satisfies for all , then . The random walk picks a coordinate at random, flip it, and accepts the move only if it remains in .
Can we establish an upper bound in for the mixing time ?
Record
- Source
- Added
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.