Image from Google Jackets

Epidemics and Rumours in Complex Networks / by M. Draief and L. Massoulie. [Electronic Resource]

By: Material type: Computer fileComputer fileSeries: London Mathematical Society Lecture Note SeriesPublication details: Cambridge : Cambridge University Press, 2009Description: vi, 123pISBN:
  • 9780511806018
Related works:
  • Massoulie, L. [Author]
Subject(s): DDC classification:
  • 004.6 D788E
Online resources: Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Home library Collection Call number Status Notes Date due Barcode Item holds
e-Book e-Book S. R. Ranganathan Learning Hub Online Textbook 004.6 D788E (Browse shelf(Opens below)) Available Platform : Cambridge Core EB0362
Total holds: 0

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.

There are no comments on this title.

to post a comment.