Asymptotic threshold for consensus discovery in structured coordination games
Statement
Let be an Erdős–Rényi random graph, let denote the trivial consensus partition, and let be the probability that a random initial strategy profile evolves into a consensus strategy profile under the stated dynamics. Consensus-discovery threshold conjecture. There exists a monotonically increasing function with
such that
This conjecture proposes a sharp asymptotic transition in the discoverability of consensus and would identify a critical connectivity level for convergence in large coordination networks; the function remains unspecified.
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.