Post-first-step monotonicity conjecture for majority dynamics
Statement
Let be a random graph sampled independently of an arbitrary initial red-blue coloring of its vertices, and let . Assume
After the first step of majority dynamics, compare the numbers of vertices of the two colors. Post-first-step monotonicity conjecture. With probability tending to , whichever color is more numerous after the first step will have increasingly more vertices after every subsequent step, until all vertices have that color. This stronger conjecture would, together with the paper's central limit theorem, determine the value of in the one-extra-vertex conjecture.
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.