Epidemics and rumours in complex networks /:
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,...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge ; New York :
Cambridge University Press,
2010.
|
| Schriftenreihe: | London Mathematical Society lecture note series ;
369. |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | 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. |
| Beschreibung: | 1 online resource (vi, 123 pages) : illustrations |
| Bibliographie: | Includes bibliographical references and index. |
| ISBN: | 9781107362253 1107362253 0511806019 9780511806018 1316087298 9781316087299 1107367166 9781107367166 1107368529 9781107368521 1299409105 9781299409101 1107364701 9781107364707 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn797859613 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 090820s2010 enka ob 001 0 eng d | ||
| 010 | |z 2009032956 | ||
| 040 | |a E7B |b eng |e pn |c E7B |d OCLCO |d UIU |d OCLCQ |d N$T |d IDEBK |d YDXCP |d OL$ |d OCLCQ |d OCLCA |d OCLCQ |d OCLCA |d UAB |d OCLCA |d OCLCF |d OCLCQ |d A6Q |d AGLDB |d VLY |d UKAHL |d OCLCO |d OCLCQ |d OCLCO |d OCLCL |d OCLCQ |d INARC |d SFB |d OCLCQ | ||
| 019 | |a 853654249 |a 902865913 |a 1030121517 |a 1030136867 |a 1097114188 |a 1105771826 |a 1119031160 |a 1162082027 |a 1162915559 |a 1182842534 |a 1195516528 |a 1257355567 |a 1257684272 |a 1424690161 | ||
| 020 | |a 9781107362253 |q (electronic bk.) | ||
| 020 | |a 1107362253 |q (electronic bk.) | ||
| 020 | |a 0511806019 |q (electronic book) | ||
| 020 | |a 9780511806018 |q (electronic book) | ||
| 020 | |z 0521734436 | ||
| 020 | |z 9780511806018 | ||
| 020 | |z 9780521517034 | ||
| 020 | |z 9780521734431 | ||
| 020 | |a 1316087298 | ||
| 020 | |a 9781316087299 | ||
| 020 | |a 1107367166 | ||
| 020 | |a 9781107367166 | ||
| 020 | |a 1107368529 | ||
| 020 | |a 9781107368521 | ||
| 020 | |a 1299409105 | ||
| 020 | |a 9781299409101 | ||
| 020 | |a 1107364701 | ||
| 020 | |a 9781107364707 | ||
| 035 | |a (OCoLC)797859613 |z (OCoLC)853654249 |z (OCoLC)902865913 |z (OCoLC)1030121517 |z (OCoLC)1030136867 |z (OCoLC)1097114188 |z (OCoLC)1105771826 |z (OCoLC)1119031160 |z (OCoLC)1162082027 |z (OCoLC)1162915559 |z (OCoLC)1182842534 |z (OCoLC)1195516528 |z (OCoLC)1257355567 |z (OCoLC)1257684272 |z (OCoLC)1424690161 | ||
| 050 | 4 | |a QA76.9.A25 |b D78 2010eb | |
| 072 | 7 | |a COM |x 020000 |2 bisacsh | |
| 072 | 7 | |a COM |x 043060 |2 bisacsh | |
| 082 | 7 | |a 004.6 |2 22 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Draief, Moez, |d 1978- |0 http://id.loc.gov/authorities/names/n2009052776 | |
| 245 | 1 | 0 | |a Epidemics and rumours in complex networks / |c Moez Draief, Laurent Massoulié. |
| 246 | 3 | |a Epidemics and rumors in complex networks | |
| 260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c 2010. | ||
| 300 | |a 1 online resource (vi, 123 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a London Mathematical Society lecture note series ; |v 369 | |
| 504 | |a Includes bibliographical references and index. | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | 0 | |t Galton-Watson branching processes -- |t Reed-Frost epidemics and Erdős-Rényi random graphs -- |t Connectivity and Poisson approximation -- |t Diameter of Erdős-Rényi graphs -- |t From microscopic to macroscopic dynamics -- |t The small-world phenomenon -- |t Power laws via preferential attachment -- |t Epidemics on general graphs -- |t Viral marketing and optimised epidemics. |
| 520 | |a 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. | ||
| 546 | |a English. | ||
| 650 | 0 | |a Computer security |x Mathematics. | |
| 650 | 0 | |a Epidemics |x Computer simulation. | |
| 650 | 0 | |a Natural computation. | |
| 650 | 0 | |a Graph theory. |0 http://id.loc.gov/authorities/subjects/sh85056471 | |
| 650 | 0 | |a Probabilities. |0 http://id.loc.gov/authorities/subjects/sh85107090 | |
| 650 | 6 | |a Sécurité informatique |x Mathématiques. | |
| 650 | 6 | |a Calcul naturel. | |
| 650 | 6 | |a Probabilités. | |
| 650 | 6 | |a Épidémies |x Simulation par ordinateur. | |
| 650 | 7 | |a probability. |2 aat | |
| 650 | 7 | |a COMPUTERS |x Data Transmission Systems |x General. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Networking |x Vendor Specific. |2 bisacsh | |
| 650 | 7 | |a Graph theory |2 fast | |
| 650 | 7 | |a Natural computation |2 fast | |
| 650 | 7 | |a Probabilities |2 fast | |
| 700 | 1 | |a Massoulié, Laurent. | |
| 758 | |i has work: |a Epidemics and rumours in complex networks (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGVCp4WvqyhHkrr6Pxgrhd |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 1 | |z 9780521517034 |z 9780521734431 | |
| 830 | 0 | |a London Mathematical Society lecture note series ; |v 369. |0 http://id.loc.gov/authorities/names/n42015587 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=551361 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH13432802 | ||
| 938 | |a ebrary |b EBRY |n ebr10560920 | ||
| 938 | |a EBSCOhost |b EBSC |n 551361 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n cis25158707 | ||
| 938 | |a YBP Library Services |b YANK |n 10374347 | ||
| 938 | |a Internet Archive |b INAR |n epidemicsrumours0000drai | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn797859613 |
|---|---|
| _version_ | 1816882199241162752 |
| adam_text | |
| any_adam_object | |
| author | Draief, Moez, 1978- |
| author2 | Massoulié, Laurent |
| author2_role | |
| author2_variant | l m lm |
| author_GND | http://id.loc.gov/authorities/names/n2009052776 |
| author_facet | Draief, Moez, 1978- Massoulié, Laurent |
| author_role | |
| author_sort | Draief, Moez, 1978- |
| author_variant | m d md |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A25 D78 2010eb |
| callnumber-search | QA76.9.A25 D78 2010eb |
| callnumber-sort | QA 276.9 A25 D78 42010EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| 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. |
| ctrlnum | (OCoLC)797859613 |
| dewey-full | 004.6 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.6 |
| dewey-search | 004.6 |
| dewey-sort | 14.6 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05542cam a2200913 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn797859613</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">090820s2010 enka ob 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="z"> 2009032956</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">E7B</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">E7B</subfield><subfield code="d">OCLCO</subfield><subfield code="d">UIU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">N$T</subfield><subfield code="d">IDEBK</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OL$</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCA</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCA</subfield><subfield code="d">UAB</subfield><subfield code="d">OCLCA</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">A6Q</subfield><subfield code="d">AGLDB</subfield><subfield code="d">VLY</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">INARC</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">853654249</subfield><subfield code="a">902865913</subfield><subfield code="a">1030121517</subfield><subfield code="a">1030136867</subfield><subfield code="a">1097114188</subfield><subfield code="a">1105771826</subfield><subfield code="a">1119031160</subfield><subfield code="a">1162082027</subfield><subfield code="a">1162915559</subfield><subfield code="a">1182842534</subfield><subfield code="a">1195516528</subfield><subfield code="a">1257355567</subfield><subfield code="a">1257684272</subfield><subfield code="a">1424690161</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107362253</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107362253</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511806019</subfield><subfield code="q">(electronic book)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511806018</subfield><subfield code="q">(electronic book)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521734436</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780511806018</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521517034</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521734431</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1316087298</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781316087299</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107367166</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107367166</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107368529</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107368521</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1299409105</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781299409101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107364701</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107364707</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)797859613</subfield><subfield code="z">(OCoLC)853654249</subfield><subfield code="z">(OCoLC)902865913</subfield><subfield code="z">(OCoLC)1030121517</subfield><subfield code="z">(OCoLC)1030136867</subfield><subfield code="z">(OCoLC)1097114188</subfield><subfield code="z">(OCoLC)1105771826</subfield><subfield code="z">(OCoLC)1119031160</subfield><subfield code="z">(OCoLC)1162082027</subfield><subfield code="z">(OCoLC)1162915559</subfield><subfield code="z">(OCoLC)1182842534</subfield><subfield code="z">(OCoLC)1195516528</subfield><subfield code="z">(OCoLC)1257355567</subfield><subfield code="z">(OCoLC)1257684272</subfield><subfield code="z">(OCoLC)1424690161</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.9.A25</subfield><subfield code="b">D78 2010eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">020000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">043060</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">004.6</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Draief, Moez,</subfield><subfield code="d">1978-</subfield><subfield code="0">http://id.loc.gov/authorities/names/n2009052776</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Epidemics and rumours in complex networks /</subfield><subfield code="c">Moez Draief, Laurent Massoulié.</subfield></datafield><datafield tag="246" ind1="3" ind2=" "><subfield code="a">Epidemics and rumors in complex networks</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">2010.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (vi, 123 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">London Mathematical Society lecture note series ;</subfield><subfield code="v">369</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Galton-Watson branching processes --</subfield><subfield code="t">Reed-Frost epidemics and Erdős-Rényi random graphs --</subfield><subfield code="t">Connectivity and Poisson approximation --</subfield><subfield code="t">Diameter of Erdős-Rényi graphs --</subfield><subfield code="t">From microscopic to macroscopic dynamics --</subfield><subfield code="t">The small-world phenomenon --</subfield><subfield code="t">Power laws via preferential attachment --</subfield><subfield code="t">Epidemics on general graphs --</subfield><subfield code="t">Viral marketing and optimised epidemics.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer security</subfield><subfield code="x">Mathematics.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Epidemics</subfield><subfield code="x">Computer simulation.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Natural computation.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Graph theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85056471</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Probabilities.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85107090</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Sécurité informatique</subfield><subfield code="x">Mathématiques.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Calcul naturel.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Probabilités.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Épidémies</subfield><subfield code="x">Simulation par ordinateur.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">probability.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Data Transmission Systems</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Networking</subfield><subfield code="x">Vendor Specific.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graph theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Natural computation</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Probabilities</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Massoulié, Laurent.</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Epidemics and rumours in complex networks (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCGVCp4WvqyhHkrr6Pxgrhd</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="1" ind2=" "><subfield code="z">9780521517034</subfield><subfield code="z">9780521734431</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">London Mathematical Society lecture note series ;</subfield><subfield code="v">369.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n42015587</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=551361</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH13432802</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10560920</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">551361</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">cis25158707</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10374347</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Internet Archive</subfield><subfield code="b">INAR</subfield><subfield code="n">epidemicsrumours0000drai</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn797859613 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:24:49Z |
| institution | BVB |
| isbn | 9781107362253 1107362253 0511806019 9780511806018 1316087298 9781316087299 1107367166 9781107367166 1107368529 9781107368521 1299409105 9781299409101 1107364701 9781107364707 |
| language | English |
| oclc_num | 797859613 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (vi, 123 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | Cambridge University Press, |
| record_format | marc |
| series | London Mathematical Society lecture note series ; |
| series2 | London Mathematical Society lecture note series ; |
| spelling | Draief, Moez, 1978- http://id.loc.gov/authorities/names/n2009052776 Epidemics and rumours in complex networks / Moez Draief, Laurent Massoulié. Epidemics and rumors in complex networks Cambridge ; New York : Cambridge University Press, 2010. 1 online resource (vi, 123 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier London Mathematical Society lecture note series ; 369 Includes bibliographical references and index. Print version record. 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. 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. Computer security Mathematics. Epidemics Computer simulation. Natural computation. Graph theory. http://id.loc.gov/authorities/subjects/sh85056471 Probabilities. http://id.loc.gov/authorities/subjects/sh85107090 Sécurité informatique Mathématiques. Calcul naturel. Probabilités. Épidémies Simulation par ordinateur. probability. aat COMPUTERS Data Transmission Systems General. bisacsh COMPUTERS Networking Vendor Specific. bisacsh Graph theory fast Natural computation fast Probabilities fast Massoulié, Laurent. has work: Epidemics and rumours in complex networks (Text) https://id.oclc.org/worldcat/entity/E39PCGVCp4WvqyhHkrr6Pxgrhd https://id.oclc.org/worldcat/ontology/hasWork 9780521517034 9780521734431 London Mathematical Society lecture note series ; 369. http://id.loc.gov/authorities/names/n42015587 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=551361 Volltext |
| spellingShingle | Draief, Moez, 1978- Epidemics and rumours in complex networks / London Mathematical Society lecture note series ; 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. Computer security Mathematics. Epidemics Computer simulation. Natural computation. Graph theory. http://id.loc.gov/authorities/subjects/sh85056471 Probabilities. http://id.loc.gov/authorities/subjects/sh85107090 Sécurité informatique Mathématiques. Calcul naturel. Probabilités. Épidémies Simulation par ordinateur. probability. aat COMPUTERS Data Transmission Systems General. bisacsh COMPUTERS Networking Vendor Specific. bisacsh Graph theory fast Natural computation fast Probabilities fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85056471 http://id.loc.gov/authorities/subjects/sh85107090 |
| title | Epidemics and rumours in complex networks / |
| title_alt | Epidemics and rumors in complex networks 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. |
| title_auth | Epidemics and rumours in complex networks / |
| title_exact_search | Epidemics and rumours in complex networks / |
| title_full | Epidemics and rumours in complex networks / Moez Draief, Laurent Massoulié. |
| title_fullStr | Epidemics and rumours in complex networks / Moez Draief, Laurent Massoulié. |
| title_full_unstemmed | Epidemics and rumours in complex networks / Moez Draief, Laurent Massoulié. |
| title_short | Epidemics and rumours in complex networks / |
| title_sort | epidemics and rumours in complex networks |
| topic | Computer security Mathematics. Epidemics Computer simulation. Natural computation. Graph theory. http://id.loc.gov/authorities/subjects/sh85056471 Probabilities. http://id.loc.gov/authorities/subjects/sh85107090 Sécurité informatique Mathématiques. Calcul naturel. Probabilités. Épidémies Simulation par ordinateur. probability. aat COMPUTERS Data Transmission Systems General. bisacsh COMPUTERS Networking Vendor Specific. bisacsh Graph theory fast Natural computation fast Probabilities fast |
| topic_facet | Computer security Mathematics. Epidemics Computer simulation. Natural computation. Graph theory. Probabilities. Sécurité informatique Mathématiques. Calcul naturel. Probabilités. Épidémies Simulation par ordinateur. probability. COMPUTERS Data Transmission Systems General. COMPUTERS Networking Vendor Specific. Graph theory Natural computation Probabilities |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=551361 |
| work_keys_str_mv | AT draiefmoez epidemicsandrumoursincomplexnetworks AT massoulielaurent epidemicsandrumoursincomplexnetworks AT draiefmoez epidemicsandrumorsincomplexnetworks AT massoulielaurent epidemicsandrumorsincomplexnetworks |