Spreading of messages in random graphs

DOI10.1007/S00224-010-9258-7zbMATH Open1208.90035OpenAlexW2147094474MaRDI QIDQ633767FDOQ633767

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

Recommendations

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

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)

Cites Work

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

Cited In (10)

• Dynamic monopolies in two-way bootstrap percolation
• Triggering cascades on undirected connected graphs
• Variants of spreading messages
• Spreading messages
• On reversible cascades in scale-free and Erdős-Rényi random graphs
• Variants of spreading messages
• Spreading Messages
• Dynamic monopolies with randomized starting configuration
• Triggering cascades on strongly connected directed graphs
• 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)