The voter model with stubborn agents extended abstract

In this paper, we analyzed opinion dynamics in large social networks. We utilized so called binary voter algorithm to model the interactions among neighbors in a given network. In particular, each neighbor holds a binary opinion, 0 or 1, and chooses one of his neighbors at random times and adapts the chosen neighbor´s decision. Moreover, there exist two disjoint sets of individuals, which have opposite opinions, and members of these sets do not change their opinions. These two sets represent stubborn people of the society.