자료유형 | 학위논문 |
---|---|
서명/저자사항 | Testing Infection Graphs. |
개인저자 | Khim, Justin Turner. |
단체저자명 | University of Pennsylvania. Statistics. |
발행사항 | [S.l.]: University of Pennsylvania., 2019. |
발행사항 | Ann Arbor: ProQuest Dissertations & Theses, 2019. |
형태사항 | 116 p. |
기본자료 저록 | Dissertations Abstracts International 81-02B. Dissertation Abstract International |
ISBN | 9781085582063 |
학위논문주기 | Thesis (Ph.D.)--University of Pennsylvania, 2019. |
일반주기 |
Source: Dissertations Abstracts International, Volume: 81-02, Section: B.
Advisor: Ma, Zongming. |
이용제한사항 | This item must not be sold to any third party vendors. |
요약 | We study the following problem: given two graphs G0 and G1 defined on a common set of n vertices and a single observation of the statuses of these vertices, i.e. either infected, uninfected, or censored, did the infection spread on G0 or G1? Modern instances of such ``infections'' include diseases such as HIV, behaviors such as smoking, or information such as online news articles. For particular stochastic spreading mechanisms, we give algorithms for this testing problem based on hypothesis discretization and permutation-invariance. Additionally, these methods also lead to confidence sets for parameters that also govern the spread of infection and for the graphs on which the infection spread. |
일반주제명 | Statistics. |
언어 | 영어 |
바로가기 |
: 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |