The bounded-degree almost sure period two conjecture for majority dynamics
Statement
Let be an infinite graph of bounded degree, and choose the initial opinions independently and uniformly from . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.