Frog model wakeup time on the complete graph

MaRDI QIDQ4691666zbMATH OpenFDO

Authors Nikki Carter, Brittany Dygert, Stephen Lacina, Collin Litterell, Austin J. Stromme, Andrew You

Publication date 24 October 2018

Full work available at URL https://arxiv.org/abs/1510.05995, https://scholar.rose-hulman.edu/rhumj/vol17/iss2/9

Mathematics Subject Classification ID

Random walks on graphs (05C81) Models of societies, social and urban evolution (91D10)

Abstract: The frog model is a system of random walks where active particles set sleeping particles in motion. On the complete graph with n vertices it is equivalent to a well-understood rumor spreading model. We given an alternate and elementary proof that the wake-up time, i.e. the expected time for every particle to be activated, is Theta(log n). Additionally, we give an explicit distributional equation for the wakeup time as a weighted sum of geometric random variables. This project was part of the University of Washington Research Experience for Undergraduates program.

Recommendations

• Laws of large numbers for the frog model on the complete graph
• scientific article; zbMATH DE number 2046076
• Recurrence and transience for the frog model on trees
• Cover time for the frog model on trees
• Frogs on trees?

Cited in

(2)

• Laws of large numbers for the frog model on the complete graph
• The coverage ratio of the frog model on complete graphs

This page was built for publication: Frog model wakeup time on the complete graph

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