Spreading of messages in random graphs

DOI10.1007/s00224-010-9258-7zbMath1208.90035OpenAlexW2147094474MaRDI QIDQ633767

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

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

Related Items (5)

Dynamic monopolies in two-way bootstrap percolation ⋮ Triggering cascades on undirected connected graphs ⋮ On reversible cascades in scale-free and Erdős-Rényi random graphs ⋮ Dynamic monopolies with randomized starting configuration ⋮ Triggering cascades on strongly connected directed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spreading messages
• Size bounds for dynamic monopolies
• Dynamic monopolies in tori.
• Local majorities, coalitions and monopolies in graphs: A review
• The power of small coalitions in graphs
• On time versus size for monotone dynamic monopolies in regular topologies
• Dynamic monopolies of constant size
• E ₁₁ and M theory
• A survey of gossiping and broadcasting in communication networks
• A simple model of global cascades on random networks
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Optimal irreversible dynamos in chordal rings

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