Brunetti, Sara and Cordasco, Gennaro and Gargano, Luisa and Lodi, Elena and Quattrociocchi, Walter Minimum weight dynamo and fast opinion spreading. In: Graph-Theoretic concepts in computer science. Lecture Notes in Computer Science (7551). Springer , pp. 249-261. ISBN 978-3-642-34611-8 (2012)
Full text not available from this repository.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.
| Item Type: | Book Section |
|---|---|
| Identification Number: | https://doi.org/10.1007/978-3-642-34611-8_26 |
| Additional Information: | 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers |
| Uncontrolled Keywords: | multicolored dynamos; information spreading; linear threshold models |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Research Area: | Computer Science and Applications |
| Depositing User: | Ms T. Iannizzi |
| Date Deposited: | 23 Jan 2014 09:20 |
| Last Modified: | 23 Jan 2014 09:20 |
| URI: | http://eprints.imtlucca.it/id/eprint/2113 |
Actions (login required)
 |
Edit Item |
