Spreading of messages in random graphs

DOI10.1007/S00224-010-9258-7MaRDI QIDQ633767zbMATH OpenOpenAlexFDO

Authors Ching-Lueh Chang, Yuh-Dauh Lyuu

Publication date 30 March 2011

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL http://ntur.lib.ntu.edu.tw/bitstream/246246/219658/1/03.pdf

zbMATH Keywords

fault propagationglobal cascadesirreversible dynamic monopolies

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30) Stochastic network models in operations research (90B15) Communication networks in operations research (90B18)

Recommendations

• Spreading messages
• Spreading Messages
• On the spread of random graphs
• On reversible cascades in scale-free and Erdős-Rényi random graphs

Cites work

• scientific article; zbMATH DE number 5764860 (Why is no real title available?)
• scientific article; zbMATH DE number 51537 (Why is no real title available?)
• scientific article; zbMATH DE number 3539473 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 857072 (Why is no real title available?)
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A simple model of global cascades on random networks
• A survey of gossiping and broadcasting in communication networks
• Dynamic monopolies in tori.
• Dynamic monopolies of constant size
• Local majorities, coalitions and monopolies in graphs: A review
• On time versus size for monotone dynamic monopolies in regular topologies
• Optimal irreversible dynamos in chordal rings
• Random graphs.
• Size bounds for dynamic monopolies
• Spreading messages
• The power of small coalitions in graphs
• \(E_{11}\) and M theory

Cited in

(11)

• 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
• Dynamic monopolies in two-way bootstrap percolation
• Constrained information transmission on Erdős-Rényi graphs
• Variants of spreading messages
• Spreading messages
• Variants of spreading messages
• Triggering cascades on strongly connected directed graphs
• Spreading Messages
• On the spread of random graphs

This page was built for publication: Spreading of messages in random graphs

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