ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Gn,pG_{n,p} be a random graph sampled independently of an arbitrary initial red-blue coloring of its vertices, and let ε>0\varepsilon>0. Assume

p≥(1+ε)log⁡nn.p\geq \frac{(1+\varepsilon)\log n}{n}.

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 11, 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 ε\varepsilon 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 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.