On Mixing and Edge Expansion Properties in Randomized Broadcasting

DOI10.1007/978-3-540-77120-3_19zbMath1193.68038OpenAlexW4252573463MaRDI QIDQ5387757

Thomas Sauerwald

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_19

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (5)

Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems ⋮ The worst case behavior of randomized gossip protocols ⋮ Asymptotically Optimal Randomized Rumor Spreading ⋮ Efficient Broadcasting in Random Power Law Networks ⋮ Introducing Quasirandomness to Computer Science

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adaptive broadcasting with faulty nodes
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• The Mathematics of Infectious Diseases
• Randomized broadcast in networks
• Asymptotic analysis of a random walk on a hypercube with many dimensions
• Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
• On Spreading a Rumor
• Assignment of Numbers to Vertices
• On the Runtime and Robustness of Randomized Broadcasting
• Probability and Computing

This page was built for publication: On Mixing and Edge Expansion Properties in Randomized Broadcasting