{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/28437"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/28437","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Stochastic models for epidemics on networks","abstract":"In this thesis, I looked at an extension of the Reed-Frost epidemic model which had two-sub-populations. By setting up a Markov chain to model the epidemic and finding the transition probabilities of that chain, MATLAB could be used to solve for the expected number of susceptibles and the expected duration. I simulated the model with more tan two sub-populations to find the average number of susceptibles and reviewed previously solved stochastic spatial models to understand how to solve the multiple-population Reed-Frost model on a network.","abstract_html":"In this thesis, I looked at an extension of the Reed-Frost epidemic model which had two-sub-populations. By setting up a Markov chain to model the epidemic and finding the transition probabilities of that chain, MATLAB could be used to solve for the expected number of susceptibles and the expected duration. I simulated the model with more tan two sub-populations to find the average number of susceptibles and reviewed previously solved stochastic spatial models to understand how to solve the multiple-population Reed-Frost model on a network.","abstract_has_math":false,"creators":["Livingston, Samantha, 1980-"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["George Verghese."],"committee_chairs":[],"committee_members":[],"year":2004,"date_issued":"2004","date_published":"2004","updated_at":"2026-07-22T22:21:57Z","subjects":["Electrical Engineering and Computer Science."],"languages":["en_US"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/28437","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["George Verghese."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Livingston, Samantha, 1980-"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2005-09-26T20:26:50Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2005-09-26T20:26:50Z"]},{"key":"dc:date.issued","label":"Date","values":["2004"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/28437"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.","Includes bibliographical references (p. 37)."]},{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis, I looked at an extension of the Reed-Frost epidemic model which had two-sub-populations. By setting up a Markov chain to model the epidemic and finding the transition probabilities of that chain, MATLAB could be used to solve for the expected number of susceptibles and the expected duration. I simulated the model with more tan two sub-populations to find the average number of susceptibles and reviewed previously solved stochastic spatial models to understand how to solve the multiple-population Reed-Frost model on a network."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Stochastic models for epidemics on networks"]}]}],"canonical_facts":{"dc:contributor.advisor":["George Verghese."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Livingston, Samantha, 1980-"],"dc:date.accessioned":["2005-09-26T20:26:50Z"],"dc:date.available":["2005-09-26T20:26:50Z"],"dc:date.issued":["2004"],"dc:description":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.","Includes bibliographical references (p. 37)."],"dc:description.abstract":["In this thesis, I looked at an extension of the Reed-Frost epidemic model which had two-sub-populations. By setting up a Markov chain to model the epidemic and finding the transition probabilities of that chain, MATLAB could be used to solve for the expected number of susceptibles and the expected duration. I simulated the model with more tan two sub-populations to find the average number of susceptibles and reviewed previously solved stochastic spatial models to understand how to solve the multiple-population Reed-Frost model on a network."],"dc:description.degree":["M.Eng."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/28437"],"dc:language.iso":["en_US"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Stochastic models for epidemics on networks"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:57Z"}