Epidemics and rumours in complex networks / Moez Draief, Laurent Massoulié.

By:

Draief, Moez, 1978-

Contributor(s):

Massoulié, Laurent

Material type: Text

TextSeries: London Mathematical Society lecture note series ; 369.Publication details: Cambridge ; New York : Cambridge University Press, 2010.Description: 1 online resource (vi, 123 pages) : illustrationsContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9781107362253
1107362253
0511806019
9780511806018
1316087298
9781316087299
1107367166
9781107367166
1107368529
9781107368521
1299409105
9781299409101
1107364701
9781107364707

Other title:

Epidemics and rumors in complex networks

Subject(s): Additional physical formats: No titleDDC classification:

004.6 22

LOC classification:

QA76.9.A25 D78 2010eb

Online resources:

EBSCOhost

Contents:

Galton-Watson branching processes -- Reed-Frost epidemics and Erdős-Rényi random graphs -- Connectivity and Poisson approximation -- Diameter of Erdős-Rényi graphs -- From microscopic to macroscopic dynamics -- The small-world phenomenon -- Power laws via preferential attachment -- Epidemics on general graphs -- Viral marketing and optimised epidemics.

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.

Holdings ( 1 )
Title notes ( 6 )

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode	Item holds
eBook	e-Library	EBSCO Computers		Available

Total holds: 0

Includes bibliographical references and index.

Print version record.

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.

English.

Added to collection customer.56279.3