Literature DB >> 27821901

Diffusion archeology for diffusion progression history reconstruction.

Emre Sefer1, Carl Kingsford2.   

Abstract

Diffusion through graphs can be used to model many real-world processes, such as the spread of diseases, social network memes, computer viruses, or water contaminants. Often, a real-world diffusion cannot be directly observed while it is occurring - perhaps it is not noticed until some time has passed, continuous monitoring is too costly, or privacy concerns limit data access. This leads to the need to reconstruct how the present state of the diffusion came to be from partial diffusion data. Here, we tackle the problem of reconstructing a diffusion history from one or more snapshots of the diffusion state. This ability can be invaluable to learn when certain computer nodes are infected or which people are the initial disease spreaders to control future diffusions. We formulate this problem over discrete-time SEIRS-type diffusion models in terms of maximum likelihood. We design methods that are based on submodularity and a novel prize-collecting dominating-set vertex cover (PCDSVC) relaxation that can identify likely diffusion steps with some provable performance guarantees. Our methods are the first to be able to reconstruct complete diffusion histories accurately in real and simulated situations. As a special case, they can also identify the initial spreaders better than the existing methods for that problem. Our results for both meme and contaminant diffusion show that the partial diffusion data problem can be overcome with proper modeling and methods, and that hidden temporal characteristics of diffusion can be predicted from limited data.

Entities:  

Keywords:  Diffusion; Diffusion History; SEIRS Dynamics; Social Networks

Year:  2015        PMID: 27821901      PMCID: PMC5095933          DOI: 10.1007/s10115-015-0904-x

Source DB:  PubMed          Journal:  Knowl Inf Syst        ISSN: 0219-3116            Impact factor:   2.822


  5 in total

1.  Emergence of scaling in random networks

Authors: 
Journal:  Science       Date:  1999-10-15       Impact factor: 47.728

2.  What energy functions can be minimized via graph cuts?

Authors:  Vladimir Kolmogorov; Ramin Zabih
Journal:  IEEE Trans Pattern Anal Mach Intell       Date:  2004-02       Impact factor: 6.226

3.  An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision.

Authors:  Yuri Boykov; Vladimir Kolmogorov
Journal:  IEEE Trans Pattern Anal Mach Intell       Date:  2004-09       Impact factor: 6.226

4.  A high-resolution human contact network for infectious disease transmission.

Authors:  Marcel Salathé; Maria Kazandjieva; Jung Woo Lee; Philip Levis; Marcus W Feldman; James H Jones
Journal:  Proc Natl Acad Sci U S A       Date:  2010-12-13       Impact factor: 11.205

5.  Epidemiologically optimal static networks from temporal network data.

Authors:  Petter Holme
Journal:  PLoS Comput Biol       Date:  2013-07-18       Impact factor: 4.475

  5 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.