相关论文: Social consensus through the influence of committe…

We consider the plurality consensus problem among $n$ agents. Initially, each agent has one of $k$ different opinions. Agents choose random interaction partners and revise their state according to a fixed transition function, depending on…

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 $x_i$ via taking the average opinion of its neighbors whose opinion differs by at…

We explore a method to influence or even control the diversity of opinions within a polarised social group. We leverage the voter model in which users hold binary opinions and repeatedly update their beliefs based on others they connect…

It is widely believed that one's peers influence product adoption behaviors. This relationship has been linked to the number of signals a decision-maker receives in a social network. But it is unclear if these same principles hold when the…

This work extends the recent opinion dynamics model from Cheng et al., emphasizing the role of group pressure in consensus formation. We generalize the findings to incorporate social influence algorithms with general time-varying,…

In this work, we study the consensus problem in which legitimate agents send their values over an undirected communication network in the presence of an unknown subset of malicious or faulty agents. In contrast to former works, we…

The massive amount of text data on the web has facilitated research on the quantitative analysis of public opinion, which could not be visualized earlier. In this paper, we propose a new opinion dynamics theory. This theory that is intended…

We study the effect of group interactions on the emergence of consensus in a spin system. Agents with discrete opinions $\{0,1\}$ form groups. They can change their opinion based on their group's influence (voter dynamics), but groups can…

We study a stochastic model of anonymous influence with conformist and anti-conformist individuals. Each agent with a `yes' or `no' initial opinion on a certain issue can change his opinion due to social influence. We consider anonymous…

Bounded confidence opinion dynamics model the propagation of information in social networks. However in the existing literature, opinions are only viewed as abstract quantities without semantics rather than as part of a decision-making…

Consider the following model to study adversarial effects on opinion forming. A set of initially selected experts form their binary opinion while being influenced by an adversary, who may convince some of them of the falsehood. All other…

How do humans respond to indirect social influence when making decisions? We analysed an experiment where subjects had to repeatedly guess the correct answer to factual questions, while having only aggregated information about the answers…

We introduce a simple model of opinion dynamics in which binary-state agents evolve due to the influence of agents in a local neighborhood. In a single update step, a fixed-size group is defined and all agents in the group adopt the state…

The way in which an opinion rejecting reform can finally become the consensus of everyone was studied by Galam (2002) in a probabilistic model. We now replace his clusters by those formed via random percolation by letting particles diffuse…

We study the outcomes of information aggregation in online social networks. Our main result is that networks with certain realistic structural properties avoid information cascades and enable a population to effectively aggregate…

At the tipping point, it is known that small incident can trigger dramatic societal shift. Getting early-warning signals for such changes are valuable to avoid detrimental outcomes such as riots or collapses of nations. However, it is…

Considerable effort using techniques developed in statistical physics has been aimed at numerical simulations of agent-based opinion models and analysis of their results. Such work has elucidated how various rules for interacting agents can…

Considering some predictive mechanisms, we show that ultrafast average-consensus can be achieved in networks of interconnected agents. More specifically, by predicting the dynamics of the network several steps ahead and using this…

Distributed consensus computation over random graph processes is considered. The random graph process is defined as a sequence of random variables which take values from the set of all possible digraphs over the node set. At each time step,…

We study the process of opinion formation in an Ising social network of scientific collaborations. The network is undirected. An Ising spin is associated with each network node being oriented up (red) or down (blue). Certain nodes carry…