Minimum Weight Dynamo and Fast Opinion Spreading

DOI10.1007/978-3-642-34611-8_26zbMATH Open1341.05107arXiv1209.6012OpenAlexW1894962886MaRDI QIDQ5200512FDOQ5200512

Authors: S. Brunetti, Gennaro Cordasco, Elena Lodi, W. Quattrociocchi, Luisa Gargano 

Publication date: 6 November 2012

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1209.6012

Recommendations

• On fast-slow consensus networks with a dynamic weight
• Multi-level dynamo and opinion spreading
• On the complexity of information spreading in dynamic networks
• Impact of weights on opinion propagation in complex networks
• Fast information spreading in graphs with large weak conductance
• Fast information spreading in graphs with large weak conductance
• Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion
• Optimizing spread dynamics on graphs by message passing
• Lower bounds on information dissemination in dynamic networks

zbMATH Keywords

information spreadinglinear threshold modelsmulticolored dynamos

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Signed and weighted graphs (05C22)

Cited In (6)

• Impact of weights on opinion propagation in complex networks
• An inclusion hierarchy of irreversible dynamos
• Variants of spreading messages
• Multi-level dynamo and opinion spreading
• Title not available (Why is that?)
• Latency-bounded target set selection in social networks

This page was built for publication: Minimum Weight Dynamo and Fast Opinion Spreading

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200512)