#10 Uniform partition sampling
Statement
Can we sample a uniformly random balanced graph partition into two pieces in polynomial time on well-behaved graphs? Specifically, can we do this on grid graphs? Wesley Pegden has an informal argument suggesting that simply running the flip walk would not mix in polynomial-time, so that does not work. Also, what if we drop the balance constraint?
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.