Agent-based randomized broadcasting in large networks

DOI10.1016/J.DAM.2006.04.035zbMath1125.68006OpenAlexW2167734910MaRDI QIDQ867856

Ulf Lorenz, Robert Elsässer, Thomas Sauerwald

Publication date: 19 February 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.04.035

zbMATH Keywords

random walksrandom graphsmobile agents

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Network design and communication in computer systems (68M10) Combinatorial probability (60C05)

Related Items (1)

On the runtime and robustness of randomized broadcasting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A guided tour of Chernoff bounds
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Diffusion schemes for load balancing on heterogeneous networks
• The Mathematics of Infectious Diseases
• How bad is selfish routing?
• Randomized broadcast in networks
• On Spreading a Rumor
• A threshold theorem for the Reed-Frost chain-binomial epidemic
• Contributions to the mathematical theory of epidemics. III.—Further studies of the problem of endemicity
• Spatial gossip and resource location protocols
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Broadcasting in random graphs

This page was built for publication: Agent-based randomized broadcasting in large networks