Rumors with changing credibility

DOI10.4230/LIPICS.ITCS.2024.86MaRDI QIDQ6906341zbMATH OpenFDO

Authors Charlotte Out, Nicolás Rivera, Thomas Sauerwald, John Sylvester

Publication date 4 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2024.86

zbMATH Keywords

``fake newsepidemic algorithmsrumor spreading

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A contribution to the mathematical theory of epidemics.
• A rumor spreading model with variable forgetting rate
• Approximating the Permanent
• Concentration Inequalities and Martingale Inequalities: A Survey
• Daley-Kendal models in fake-news scenario
• Faster rumor spreading with multiple calls
• Giant components in random temporal graphs
• scientific article; zbMATH DE number 5454133 (Why is no real title available?)
• Information spreading in dynamic graphs
• On Spreading a Rumor
• Optimal Construction of Edge-Disjoint Paths in Random Graphs
• Randomized Rumor Spreading in Dynamic Graphs
• Randomized rumor spreading revisited
• Randomized rumour spreading: the effect of the network topology
• Robustness of randomized rumour spreading
• Rumor spreading and conductance
• Rumor spreading in random evolving graphs
• Rumor spreading on random regular graphs and expanders
• Rumor spreading with bounded in-degree
• Sharp thresholds in random simple temporal graphs
• The shortest-path problem for graphs with random arc-lengths
• Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks
• Tight bounds for rumor spreading with vertex expansion

This page was built for publication: Rumors with changing credibility

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