Probability of Consensus of Hegselmann-Krause Dynamics
Abstract
The original Hegselmann-Krause (HK) model comprises a set of n agents characterized by their opinion, a number in [0,1]. Agent i updates its opinion xi via taking the average opinion of its neighbors whose opinion differs by at most ε from xi. In the article, the opinion space is extended to Rd. The main result is to derive bounds for the probability of consensus. In general, we have a positive lower bound for the probability of consensus and demonstrate a lower bound for the probability of consensus on a unit cube. In particular for one dimensional case, we derive an upper bound and a better lower bound for the probability of consensus and demonstrate them on a unit interval.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.