Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Epidemics and Rumours in Complex Networks
  • Cited by 33
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      January 2011
      December 2009
      ISBN:
      9780511806018
      9780521734431
      DOI:
      https://doi.org/10.1017/CBO9780511806018
      Dimensions:
      Weight & Pages:
      Dimensions:
      (228 x 152 mm)
      Weight & Pages:
      0.21kg, 130 Pages
      • Subjects:
      Mathematics (general), Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Applied Probability and Stochastic Networks, Statistics and Probability
      Series:
      London Mathematical Society Lecture Note Series (369)
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Mathematics (general), Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Applied Probability and Stochastic Networks, Statistics and Probability
    Series:
    London Mathematical Society Lecture Note Series (369)
    Information

    Book description

    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.

    Reviews

    '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.'

    Source: Zentralblatt MATH

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.