Lifting Majority to Unanimity in Opinion Diffusion

View/ Open
File version
Version of Record (VoR)
Author(s)
Zhuang, Zhiqiang
Wang, Kewen
Wang, Junhu
Zhang, Heng
Wang, Zhe
Gong, Zhiguo
Year published
2020
Metadata
Show full item recordAbstract
In this paper, we study an information exchange process in which a network of individuals exchanges a binary opinion. In the process, the individuals change their opinions only if a majority of their neighbours have the opposite opinion and they do it synchronously. Motivated by applications in multiagent systems, distributed computing, and social science, our goal is to derive graph-theoretic features of the network that guarantee whenever a majority of individuals initially have the same opinion, they will eventually spread the opinion to all individuals. We tackle the problem by first introducing a graph-theoretic notion ...
View more >In this paper, we study an information exchange process in which a network of individuals exchanges a binary opinion. In the process, the individuals change their opinions only if a majority of their neighbours have the opposite opinion and they do it synchronously. Motivated by applications in multiagent systems, distributed computing, and social science, our goal is to derive graph-theoretic features of the network that guarantee whenever a majority of individuals initially have the same opinion, they will eventually spread the opinion to all individuals. We tackle the problem by first introducing a graph-theoretic notion called controlling set which is capable of characterising the information exchange process and, by exploiting the notion, we obtain a series of lower and upper bounds on the in-degree of vertices as well as lower bound on the size of certain neighbourhoods for guaranteeing the majority to unanimity behaviour.
View less >
View more >In this paper, we study an information exchange process in which a network of individuals exchanges a binary opinion. In the process, the individuals change their opinions only if a majority of their neighbours have the opposite opinion and they do it synchronously. Motivated by applications in multiagent systems, distributed computing, and social science, our goal is to derive graph-theoretic features of the network that guarantee whenever a majority of individuals initially have the same opinion, they will eventually spread the opinion to all individuals. We tackle the problem by first introducing a graph-theoretic notion called controlling set which is capable of characterising the information exchange process and, by exploiting the notion, we obtain a series of lower and upper bounds on the in-degree of vertices as well as lower bound on the size of certain neighbourhoods for guaranteeing the majority to unanimity behaviour.
View less >
Conference Title
Frontiers in Artificial Intelligence and Applications
Volume
325
Copyright Statement
© 2020 The authors and IOS Press. This article is published online with Open Access by IOS Press and distributed under the terms of the Creative Commons Attribution Non-Commercial License 4.0 (CC BY-NC 4.0).
Subject
Artificial intelligence