ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an infinite graph of bounded degree, and choose the initial opinions independently and uniformly from {−1,1}\{-1,1\}. Under majority dynamics, each node's opinion almost surely converges to a cycle of period at most two. Almost sure period two conjecture. Every bounded-degree graph has the almost sure period two property. The conjecture extends the almost sure period two theorem for unimodular transitive graphs to all bounded-degree graphs. The paper gives an infinite counterexample without bounded degree, while the bounded-degree case is left open.

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.