東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Phase Transitions of Epidemics on Ra...

Nam, Dong Hoon.

Linked to FindBook

Google Book

Amazon

博客來

Phase Transitions of Epidemics on Random Graphs.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Phase Transitions of Epidemics on Random Graphs./
Author:	Nam, Dong Hoon.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
Description:	218 p.
Notes:	Source: Dissertations Abstracts International, Volume: 82-12, Section: B.
Contained By:	Dissertations Abstracts International82-12B.
Subject:	Mathematics. -
Online resource:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28495459
ISBN:	9798515272258

Phase Transitions of Epidemics on Random Graphs.
Nam, Dong Hoon.

Phase Transitions of Epidemics on Random Graphs. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 218 p.

Source: Dissertations Abstracts International, Volume: 82-12, Section: B.

Thesis (Ph.D.)--Princeton University, 2021.

This item must not be sold to any third party vendors.

This thesis focuses on the study of two mathematical models of epidemics, namely the contact process and the threshold-θ contact process. Until recently, rigorous understanding of their phase transition was mostly limited to the cases of elementary underlying networks such as lattices, homogeneous trees, and random regular graphs. The purpose of this work is to present recent advances in analyzing their behavior on general random graphs, including Galton-Watson trees, Erdoos-Renyi random graphs, and the configuration model.In the contact process, each individual is either infected or healthy. An infected individual can infect its neighbors or become healthy, with both events happening independently at certain rates. Its behavior can intuitively be understood as follows: when the infection is weak, the epidemic dies out quickly (extinction phase); on the other hand, when the infection is strong, the epidemic survives for a long time (survival phase). We propose new techniques to study the survival time of the process and establish the necessary and sufficient criteria for the existence of the extinction phase on Galton-Watson trees. Moreover, the corresponding analogs on random graphs are developed. Additionally, we extend our methods to derive the asymptotics for the value of the infection rate at the threshold.We then consider the discrete-time threshold-θ contact process, where an individual becomes infected in the next time step with probability p, if it had at least θ neighboring infections in the current step. On (sparse) Erdoos-Renyi graphs with large enough average degree, we establish a discontinuous phase transition in the emergence of metastability: (i) if p is large enough, the process starting from a high density of infections shows a long survival, keeping its infection density above a certain level; (ii) if either p is small or the initial state has a low density of infections, the process exhibits a short survival. We further present the analogs of the result on other random graphs. Finally, we discuss the contrasting result for the low-degree random regular graph on which the process only displays a short survival.

ISBN: 9798515272258Subjects--Topical Terms:

515831
Mathematics.
Subjects--Index Terms:

Contact process

Phase Transitions of Epidemics on Random Graphs.
LDR:03356nmm a2200385 4500 001 2284921
005 20211124093254.5
008 220723s2021 ||||||||||||||||| ||eng d
020 $a 9798515272258
035 $a (MiAaPQ)AAI28495459
035 $a AAI28495459
040 $a MiAaPQ $c MiAaPQ
100 1 $a Nam, Dong Hoon. $3 3564139
245 1 0 $a Phase Transitions of Epidemics on Random Graphs.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 218 p.
500 $a Source: Dissertations Abstracts International, Volume: 82-12, Section: B.
500 $a Advisor: Sly, Allan Murray.
502 $a Thesis (Ph.D.)--Princeton University, 2021.
506 $a This item must not be sold to any third party vendors.
520 $a This thesis focuses on the study of two mathematical models of epidemics, namely the contact process and the threshold-θ contact process. Until recently, rigorous understanding of their phase transition was mostly limited to the cases of elementary underlying networks such as lattices, homogeneous trees, and random regular graphs. The purpose of this work is to present recent advances in analyzing their behavior on general random graphs, including Galton-Watson trees, Erdoos-Renyi random graphs, and the configuration model.In the contact process, each individual is either infected or healthy. An infected individual can infect its neighbors or become healthy, with both events happening independently at certain rates. Its behavior can intuitively be understood as follows: when the infection is weak, the epidemic dies out quickly (extinction phase); on the other hand, when the infection is strong, the epidemic survives for a long time (survival phase). We propose new techniques to study the survival time of the process and establish the necessary and sufficient criteria for the existence of the extinction phase on Galton-Watson trees. Moreover, the corresponding analogs on random graphs are developed. Additionally, we extend our methods to derive the asymptotics for the value of the infection rate at the threshold.We then consider the discrete-time threshold-θ contact process, where an individual becomes infected in the next time step with probability p, if it had at least θ neighboring infections in the current step. On (sparse) Erdoos-Renyi graphs with large enough average degree, we establish a discontinuous phase transition in the emergence of metastability: (i) if p is large enough, the process starting from a high density of infections shows a long survival, keeping its infection density above a certain level; (ii) if either p is small or the initial state has a low density of infections, the process exhibits a short survival. We further present the analogs of the result on other random graphs. Finally, we discuss the contrasting result for the low-degree random regular graph on which the process only displays a short survival.
590 $a School code: 0181.
650 4 $a Mathematics. $3 515831
650 4 $a Biostatistics. $3 1002712
650 4 $a Epidemiology. $3 568544
653 $a Contact process
653 $a Galton-Watson trees
653 $a Networks
653 $a Threshold contact process
653 $a Erdoos-Renyi random graphs
653 $a Configuration model
690 $a 0405
690 $a 0766
690 $a 0308
710 2 $a Princeton University. $b Mathematics. $3 2049791
773 0 $t Dissertations Abstracts International $g 82-12B.
790 $a 0181
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28495459