Ding–Mossel monotone-censoring mixing question
Statement
For every , there exists a constant such that, for every and every increasing set in satisfying , the lazy random walk on the Boolean cube censored to has mixing time . The cited preprint gives the more explicit bound for an absolute constant .
Record
- 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.