Epidemics and rumours in complex networks

Epidemics and rumours in complex networks

by Moez Draief

Book 369 of London Mathematical Society lecture note series --

2010

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

1 readers worldwide want to read this book

Start a club free
About
This book is a concise introduction for applied mathematicians and computer scientists to basic models, analytical tools and mathematical and algorithmic results. Mathematical tools introduced include coupling methods, Poisson approximation (the Stein-Chen method), concentration inequalities (Chernoff bounds and Azuma-Hoeffding inequality) and branching processes. The authors examine the small-world phenomenon, preferential attachment, as well as classical epidemics. --from publisher description.

Discuss Epidemics and rumours in complex networks with other readers

Join or start a book club for Epidemics and rumours in complex networks on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Epidemics and rumours in complex networks?

Sign up free on Readfeed, then browse public clubs or start your own club with Epidemics and rumours in complex networks as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Epidemics and rumours in complex networks with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Epidemics and rumours in complex networks with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.