Finite-time constant-topology conjecture for heterogeneous Hegselmann–Krause dynamics

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}:yiyjri}\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.

Sources & referencesView supporting material

Primary source

Anahita Mirtabatabaei and Francesco Bullo, “On Opinion Dynamics in Heterogeneous Networks”, arXiv:1010.2186 (2011).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.