Randomized rumor spreading in poorly connected small-world networks

DOI10.1002/rsa.20624zbMath1344.05129arXiv1410.8175OpenAlexW2917208934MaRDI QIDQ2818280

Ali Pourmiri, Abbas Mehrabian

Publication date: 7 September 2016

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.8175

zbMATH Keywords

urn modelsrandomized rumor spreadingpush-pull protocolrandom \(k\)-Apollonian networksrandom \(k\)-trees

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)

Related Items

ILSCR rumor spreading model to discuss the control of rumor spreading in emergency, On the Push&Pull Protocol for Rumor Spreading, Probabilistic zero forcing on random graphs, Bounds on expected propagation time of probabilistic zero forcing

Cites Work

• Unnamed Item
• Unnamed Item
• Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
• Scale free properties of random \(k\)-trees
• Limit theorems for triangular urn schemes
• The degree distribution of random \(k\)-trees
• Treewidth. Computations and approximations
• Asynchronous Rumor Spreading in Preferential Attachment Graphs
• Resource discovery in distributed networks
• Randomized broadcast in networks
• Further Inequalities for the Gamma Function
• High-dimensional Apollonian networks
• Random Trees
• Rumor Spreading on Random Regular Graphs and Expanders
• Rumor Spreading in Social Networks
• A survey of gossiping and broadcasting in communication networks
• The Spectra of Random Graphs with Given Expected Degrees
• The height of random k‐trees and related branching processes
• Collective dynamics of ‘small-world’ networks
• Randomized Rumour Spreading: The Effect of the Network Topology
• Social networks spread rumors in sublogarithmic time