ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Γn,N(n)\Gamma_{n,N(n)} be an Erdős–Rényi random graph, let QΓn,N(n)0Q_{\Gamma_{n,N(n)}}^0 denote the trivial consensus partition, and let ϕ(QΓn,N(n)0)\phi(Q_{\Gamma_{n,N(n)}}^0) 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 B(n)B(n) with

lim⁡n→∞B(n)=∞\lim_{n\rightarrow\infty}B(n)=\infty

such that

lim⁡n→∞ϕ(QΓn,N(n)0)={0lim⁡n→∞N(n)B(n)=01lim⁡n→∞N(n)B(n)=∞.\lim_{n\rightarrow\infty}\phi(Q_{\Gamma_{n,N(n)}}^0)=\begin{cases}0&\lim_{n\rightarrow\infty}\frac{N(n)}{B(n)}=0\\1&\lim_{n\rightarrow\infty}\frac{N(n)}{B(n)}=\infty.\end{cases}

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 B(n)B(n) 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 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.