Minimum weight dynamo and fast opinion spreading

Authors:
Sara Brunetti;Gennaro Cordasco;Luisa Gargano;Elena Lodi;Walter Quattrociocchi
Affiliations:
Department of Mathematics and Computer Science, University of Siena, Italy;Department of Psychology, Second University of Naples, Italy;Department of Computer Science, University of Salerno, Italy;Department of Mathematics and Computer Science, University of Siena, Italy;Department of Mathematics and Computer Science, University of Siena, Italy
Venue:
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Year:
2012

Citing 12
Cited 0

Fast Gossiping by Short Messages

SIAM Journal on Computing
Size bounds for dynamic monopolies

Discrete Applied Mathematics
Mining the network value of customers

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Local majorities, coalitions and monopolies in graphs: a review

Theoretical Computer Science
Efficient Construction of Catastrophic Patterns for VLSI Reconfigurable Arrays with Bidirectional Links

ICCI '92 Proceedings of the Fourth International Conference on Computing and Information: Computing and Information
The power of small coalitions in graphs

Discrete Applied Mathematics
Maximizing the spread of influence through a social network

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
On time versus size for monotone dynamic monopolies in regular topologies

Journal of Discrete Algorithms
On the Approximability of Influence in Social Networks

SIAM Journal on Discrete Mathematics
Networks, Crowds, and Markets: Reasoning About a Highly Connected World

Networks, Crowds, and Markets: Reasoning About a Highly Connected World
Dynamic monopolies with randomized starting configuration

Theoretical Computer Science
Dynamic Monopolies in Colored Tori

IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the following multi---level opinion spreading model on networks. Initially, each node gets a weight from the set {0,…,k−1}, where such a weight stands for the individuals conviction of a new idea or product. Then, by proceeding to rounds, each node updates its weight according to the weights of its neighbors. We are interested in the initial assignments of weights leading each node to get the value k−1 ---e.g. unanimous maximum level acceptance--- within a given number of rounds. We determine lower bounds on the sum of the initial weights of the nodes under the irreversible simple majority rules, where a node increases its weight if and only if the majority of its neighbors have a weight that is higher than its own one. Moreover, we provide constructive tight upper bounds for some class of regular topologies: rings, tori, and cliques.