39,960 research outputs found
Evolution of opinions on social networks in the presence of competing committed groups
Public opinion is often affected by the presence of committed groups of
individuals dedicated to competing points of view. Using a model of pairwise
social influence, we study how the presence of such groups within social
networks affects the outcome and the speed of evolution of the overall opinion
on the network. Earlier work indicated that a single committed group within a
dense social network can cause the entire network to quickly adopt the group's
opinion (in times scaling logarithmically with the network size), so long as
the committed group constitutes more than about 10% of the population (with the
findings being qualitatively similar for sparse networks as well). Here we
study the more general case of opinion evolution when two groups committed to
distinct, competing opinions and , and constituting fractions and
of the total population respectively, are present in the network. We show
for stylized social networks (including Erd\H{o}s-R\'enyi random graphs and
Barab\'asi-Albert scale-free networks) that the phase diagram of this system in
parameter space consists of two regions, one where two stable
steady-states coexist, and the remaining where only a single stable
steady-state exists. These two regions are separated by two fold-bifurcation
(spinodal) lines which meet tangentially and terminate at a cusp (critical
point). We provide further insights to the phase diagram and to the nature of
the underlying phase transitions by investigating the model on infinite
(mean-field limit), finite complete graphs and finite sparse networks. For the
latter case, we also derive the scaling exponent associated with the
exponential growth of switching times as a function of the distance from the
critical point.Comment: 23 pages: 15 pages + 7 figures (main text), 8 pages + 1 figure + 1
table (supplementary info
Exact Byzantine Consensus on Arbitrary Directed Graphs Under Local Broadcast Model
We consider Byzantine consensus in a synchronous system where nodes are connected by a network modeled as a directed graph, i.e., communication links between neighboring nodes are not necessarily bi-directional. The directed graph model is motivated by wireless networks wherein asymmetric communication links can occur. In the classical point-to-point communication model, a message sent on a communication link is private between the two nodes on the link. This allows a Byzantine faulty node to equivocate, i.e., send inconsistent information to its neighbors. This paper considers the local broadcast model of communication, wherein transmission by a node is received identically by all of its outgoing neighbors, effectively depriving the faulty nodes of the ability to equivocate.
Prior work has obtained sufficient and necessary conditions on undirected graphs to be able to achieve Byzantine consensus under the local broadcast model. In this paper, we obtain tight conditions on directed graphs to be able to achieve Byzantine consensus with binary inputs under the local broadcast model. The results obtained in the paper provide insights into the trade-off between directionality of communication links and the ability to achieve consensus
- …