Spread of information and diseases via random walks in sparse graphs

DOI10.4230/LIPICS.DISC.2020.9MaRDI QIDQ6535006zbMATH OpenFDO

Authors George Giakkoupis, Hayk Saribekyan, Thomas Sauerwald

Publication date 2 November 2023

Full work available at URL https://doi.org/10.4230/LIPICS.DISC.2020.9

zbMATH Keywords

information disseminationparallel random walksinfectious diseases

Mathematics Subject Classification ID

Epidemiology (92D30) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70) Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30) Random walks on graphs (05C81)

Recommendations

• scientific article; zbMATH DE number 17689
• Spatio-temporal dynamics of random transmission events: from information sharing to epidemic spread
• A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
• Information dissemination via random walks in d-dimensional space
• Infection spread in random geometric graphs
• Spread of infection over P.A. random graphs with edge insertion
• Pandemic spread in communities via random graphs
• Coupling dynamics of epidemic spreading and information diffusion on complex networks
• Information propagation in stochastic networks

Cites work

• scientific article; zbMATH DE number 3126031 (Why is no real title available?)
• scientific article; zbMATH DE number 2046076 (Why is no real title available?)
• A shape theorem for the spread of an infection
• Branching random walk with catalysts
• Concentration Inequalities and Martingale Inequalities: A Survey
• Frogs on trees?
• How Well Do Random Walks Parallelize?
• How to Spread a Rumor
• Information dissemination via random walks in d-dimensional space
• Many Random Walks Are Faster Than One
• Multiple random walks in random regular graphs
• Percolation of Lipschitz surface and tight bounds on the spread of information among mobile agents
• Randomized broadcast in networks
• Rumor spreading and conductance
• Sharp bounds on random walk eigenvalues via spectral embedding
• Social networks spread rumors in sublogarithmic time
• The infection time of graphs
• The shape theorem for the frog model
• The spread of a rumor or infection in a moving population
• Tight bounds for the cover time of multiple random walks
• Tight bounds on information dissemination in sparse mobile networks
• Trading Space for Time in Undirected s-t Connectivity

Cited in

(1)

• Containing viral spread on sparse random graphs: bounds, algorithms, and experiments

This page was built for publication: Spread of information and diseases via random walks in sparse graphs

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