Epidemics and Rumours in Complex Networks
£60.99
Part of London Mathematical Society Lecture Note Series
- Authors:
- Moez Draief, Imperial College of Science, Technology and Medicine, London
- Laurent Massoulié, Thomson, Corporate Research, Paris
- Date Published: December 2009
- availability: Available
- format: Paperback
- isbn: 9780521734431
£
60.99
Paperback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
Information propagation through peer-to-peer systems, online social systems, wireless mobile ad hoc networks and other modern structures can be modelled as an epidemic on a network of contacts. Understanding how epidemic processes interact with network topology allows us to predict ultimate course, understand phase transitions and develop strategies to control and optimise dissemination. 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. Each chapter ends with pointers to the wider literature. An ideal accompaniment for graduate courses, this book is also for researchers (statistical physicists, biologists, social scientists) who need an efficient guide to modern approaches to epidemic modelling on networks.
Read more- Provides a clear and rigorous treatment using both probabilistic and algorithmic approaches
- Coverage includes well-known techniques and results as well as more recent advances
- Includes end-of-chapter guides to the wider literature, ideal for researchers new to the field
Reviews & endorsements
'this is a nice introduction, at the level of a graduate course, to the propagation of biological epidemics and the spread of rumours in networks, aimed at students in computer science and applied probability.' Zentralblatt MATH
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: December 2009
- format: Paperback
- isbn: 9780521734431
- length: 130 pages
- dimensions: 221 x 150 x 10 mm
- weight: 0.21kg
- contains: 3 b/w illus.
- availability: Available
Table of Contents
Introduction
Part I. Shapeless Networks:
1. Galton-Watson branching processes
2. Reed-Frost epidemics and Erdős-Rényi random graphs
3. Connectivity and Poisson approximation
4. Diameter of Erdős-Rényi graphs
5. From microscopic to macroscopic dynamics
Part II. Structured Networks:
6. The small-world phenomenon
7. Power laws via preferential attachment
8. Epidemics on general graphs
9. Viral marketing and optimised epidemics
References
Index.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×