Spreading messages

DOI10.1016/J.TCS.2009.03.032MaRDI QIDQ1029342zbMATH OpenOpenAlexFDO

Authors Ching-Lueh Chang, Yuh-Dauh Lyuu

Publication date 10 July 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.03.032

zbMATH Keywords

global cascadeirreversible dynamotrust propagation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Spreading Messages
• Spreading of messages in random graphs
• Variants of spreading messages
• Variants of spreading messages
• Evangelism in social networks: algorithms and complexity

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 5764860 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 3238721 (Why is no real title available?)
• A simple model of global cascades on random networks
• A survey of gossiping and broadcasting in communication networks
• Approximating average parameters of graphs
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Dynamic monopolies of constant size
• Exploring complex networks
• Local majorities, coalitions and monopolies in graphs: A review
• Optimal irreversible dynamos in chordal rings
• Paths in graphs
• Probability Inequalities for Sums of Bounded Random Variables
• Probability and Computing
• Size bounds for dynamic monopolies
• The power of small coalitions in graphs

Cited in

(17)

• On dynamic monopolies of graphs with probabilistic thresholds
• On reversible cascades in scale-free and Erdős-Rényi random graphs
• Dynamic monopolies with randomized starting configuration
• Triggering cascades on undirected connected graphs
• On dynamic monopolies of graphs: the average and strict majority thresholds
• Variants of spreading messages
• On non-progressive spread of influence through social networks
• Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
• Parameterized approximability of maximizing the spread of influence in networks
• Spreading of messages in random graphs
• scientific article; zbMATH DE number 1947759 (Why is no real title available?)
• Variants of spreading messages
• An inclusion hierarchy of irreversible dynamos
• Spreading Messages
• Constant thresholds can make target set selection tractable
• Combinatorial model and bounds for target set selection
• On dynamic monopolies of graphs with general thresholds

This page was built for publication: Spreading messages

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