ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r={r1,…,rn}∈R>0nr=\{r_1,\dots,r_n\}\in\mathbb{R}^n_{>0} be the agents' confidence bounds and let x(t)∈Rnx(t)\in\mathbb{R}^n evolve according to the heterogeneous Hegselmann–Krause system

x(t+1)=A(x(t))x(t),x(t+1)=A(x(t))x(t),

where Gr(y)G_r(y) is the proximity digraph with out-neighbors Ni(y)={j∈{1,…,n}:∣yi−yj∣≤ri}\mathcal{N}_i(y)=\{j\in\{1,\dots,n\}:|y_i-y_j|\leq r_i\} and A(y)A(y) averages the opinions over each agent's out-neighbors. Constant-topology conjecture. Along every trajectory, there exists a finite time τ\tau such that

Gr(x(t))=Gr(x(τ))for all t≥τ.G_r(x(t))=G_r(x(\tau))\qquad\text{for all }t\geq\tau.

If the interconnection topology becomes fixed, the resulting linear averaging dynamics can be analyzed using fixed-topology methods; the conjecture would in particular imply convergence of every heterogeneous HK trajectory to a steady state. The paper reports extensive numerical evidence, but states that a proof remains 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.