Show simple item record

dc.contributor.authorPrakash, B. Aditya
dc.contributor.authorChakrabarti, Deepayan
dc.contributor.authorFaloutsos, Michalis
dc.contributor.authorValler, Nicholas
dc.contributor.authorFaloutsos, Christos
dc.date.accessioned2018-03-02T14:09:51Z
dc.date.available2018-03-02T14:09:51Z
dc.date.issued2010-03-30
dc.identifier.urihttp://hdl.handle.net/10919/82435
dc.description.abstractFor a given, arbitrary graph, what is the epidemic threshold? That is, under what conditions will a virus result in an epidemic? We provide the super-model theorem, which generalizes older results in two important, orthogonal dimensions. The theorem shows that (a) for a wide range of virus propagation models (VPM) that include all virus propagation models in standard literature (say, [8][5]), and (b) for any contact graph, the answer always depends on the first eigenvalue of the connectivity matrix. We give the proof of the theorem, arithmetic examples for popular VPMs, like flu (SIS), mumps (SIR), SIRS and more. We also show the implications of our discovery: easy (although sometimes counter-intuitive) answers to ‘what-if’ questions; easier design and evaluation of immunization policies, and significantly faster agent-based simulations. badityap@en_US
dc.language.isoen_USen_US
dc.publisherVirginia Techen_US
dc.titleGot the Flu (or Mumps)? Check the Eigenvalue!en_US
dc.typeArticleen_US
dc.description.notesUnpublished paper.en_US
dc.identifier.urlhttps://arxiv.org/abs/1004.0060


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record