000			01955nmm a2200229Ia 4500
008			220920s9999||||xx |||||||||||||| ||und||
020			_a9780511806018
082			_a004.6 _bD788E
100			_aDraief, M. _eAuthor _lEnglish _91791
245		0	_aEpidemics and Rumours in Complex Networks _c/ by M. Draief and L. Massoulie. _h[Electronic Resource]
260			_aCambridge _b: Cambridge University Press, _c2009
300			_avi, 123p.
440			_aLondon Mathematical Society Lecture Note Series _91792
520			_aInformation 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.
650			_aComputer Science _9926
650			_aMathematics _913
650			_aNetworks _91793
650			_aStochastic Networks _91794
700			_aMassoulie, L. _i[Author] _91795
856			_uhttps://doi.org/10.1017/CBO9780511806018 _qPDF _yClick to Access the Online Book
942			_cEBK _nYes
999			_c12222 _d12222