Recommendations
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)- 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
- Spreading Messages
- Variants of spreading messages
- Dynamic monopolies with randomized starting configuration
- Constrained information transmission on Erdős-Rényi graphs
- 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)
