dc.date.accessioned | 2013-11-21T11:02:56Z | |
dc.date.available | 2013-11-21T11:02:56Z | |
dc.date.issued | 2013 | en_US |
dc.date.submitted | 2013-06-12 | en_US |
dc.identifier.citation | Kjeldsen, Jing. The probability for infection in SIR and SIS networks. Masteroppgave, University of Oslo, 2013 | en_US |
dc.identifier.uri | http://hdl.handle.net/10852/37712 | |
dc.description.abstract | When we inspect a disease, the social structure may be important for how a disease spread. The people with many friends, may face a bigger risk for infection than a person with few friends. The social network we may represent by a graph, where the vertices represents persons, and the edges represents vertices. We will in this thesis use two epidemic models for how the infection propegate: The SIR network and the SIS network.
In this thesis we will show three properties for the models. The monotonicity properties, the epidemic threshold and computing the probabilites are #P-hard. Also, we will describe two algorithm for computing the probabilities: an exact algorithm and a Monte-Carlo algorithm. | eng |
dc.language.iso | nob | en_US |
dc.title | The probability for infection in SIR and SIS networks | en_US |
dc.type | Master thesis | en_US |
dc.date.updated | 2013-11-15 | en_US |
dc.creator.author | Kjeldsen, Jing | en_US |
dc.subject.nsi | VDP::410 | en_US |
dc.identifier.bibliographiccitation | info:ofi/fmt:kev:mtx:ctx&ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft.au=Kjeldsen, Jing&rft.title=The probability for infection in SIR and SIS networks&rft.inst=University of Oslo&rft.date=2013&rft.degree=Masteroppgave | en_US |
dc.identifier.urn | URN:NBN:no-39720 | |
dc.type.document | Masteroppgave | en_US |
dc.identifier.duo | 182846 | en_US |
dc.contributor.supervisor | Geir Dahl | en_US |
dc.identifier.fulltext | Fulltext https://www.duo.uio.no/bitstream/handle/10852/37712/1/JingKjeldsen_master.pdf | |