IDEAS home Printed from https://ideas.repec.org/a/taf/jnlasa/v116y2021i534p770-782.html
   My bibliography  Save this article

Permutation Tests for Infection Graphs

Author

Listed:
  • Justin Khim
  • Po-Ling Loh

Abstract

We formulate and analyze a novel hypothesis testing problem for inferring the edge structure of an infection graph. In our model, a disease spreads over a network via contagion or random infection, where the times between successive contagion events are independent exponential random variables with unknown rate parameters. A subset of nodes is also censored uniformly at random. Given the observed infection statuses of nodes in the network, the goal is to determine the underlying graph. We present a procedure based on permutation testing, and we derive sufficient conditions for the validity of our test in terms of automorphism groups of the graphs corresponding to the null and alternative hypotheses. Our test is easy to compute and does not involve estimating unknown parameters governing the process. We also derive risk bounds for our permutation test in a variety of settings, and relate our test statistic to approximate likelihood ratio testing and maximin tests. For graphs not satisfying the necessary symmetries, we provide an additional method for testing the significance of the graph structure, albeit at a higher computational cost. We conclude with an application to real data from an HIV infection network. Supplementary materials for this article are available online.

Suggested Citation

  • Justin Khim & Po-Ling Loh, 2021. "Permutation Tests for Infection Graphs," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 116(534), pages 770-782, April.
  • Handle: RePEc:taf:jnlasa:v:116:y:2021:i:534:p:770-782
    DOI: 10.1080/01621459.2019.1700128
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01621459.2019.1700128
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01621459.2019.1700128?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:jnlasa:v:116:y:2021:i:534:p:770-782. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/UASA20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.