Finding the probability of infection in an SIR network is NP-hard
type: Item
instance of: scholarly article
title: Finding the probability of infection in an SIR network is NP-hard
zbMATH Open document ID: 1316.92093
author: Yanyan Li
published in: Mathematical Biosciences
publication date: 2012-12-28T00:00:00Z
full work available at URL: pmc3478503
Mathematics Subject Classification ID: 92D30
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6119009
zbMATH Keywords: epidemics
zbMATH Keywords: SIR networks
zbMATH Keywords: contact network
zbMATH Keywords: network reliability
zbMATH Keywords: NP-hard
MaRDI profile type: Publication
OpenAlex ID: W2027314599
Wikidata QID: Q38028677
cites work: The Structure and Function of Complex Networks
cites work: The implications of network structure for epidemic dynamics
cites work: Predicting epidemics on directed contact networks
cites work: SIR dynamics in random networks with heterogeneous connectivity
cites work: Pandemic simulation of antivirals+school closures: buying time until strain-specific vaccine is available
cites work: Q5501331
cites work: Inoculation strategies for victims of viruses and the sum-of-squares partition problem
cites work: Algorithms – ESA 2005
cites work: Computational complexity of impact size estimation for spreading processes on networks
cites work: Scalable influence maximization for independent cascade model in large-scale social networks
cites work: Q5592246
cites work: Q4875182
cites work: Some elementary properties of SIR networks or, Can I get sick because you got vaccinated?
cites work: On the critical behavior of the general epidemic process and dynamical percolation
cites work: Percolation on heterogeneous networks as a model for epidemics
cites work: Contact network epidemiology: Bond percolation applied to infectious disease prediction and control
cites work: Complexity of network reliability computations
cites work: Computing the Reliability of Complex Networks
cites work: Computing Network Reliability
cites work: A Survey of Network Reliability and Domination Theory
cites work: Q4888903
cites work: Collective dynamics of ‘small-world’ networks
cites work: Q4158362
cites work: Q3569540
cites work: A Monte Carlo Sampling Plan for Estimating Network Reliability
cites work: Q4262222
cites work: THE TREE CUT AND MERGE ALGORITHM FOR ESTIMATION OF NETWORK RELIABILITY
cites work: The cross-entropy method for network reliability estimation
DOI: 10.1016/J.MBS.2012.07.002
description: scientific article; zbMATH DE number 6119009