Utility Mobile

General Information

Artifact Type
Presentation
Title: Perturbative approximations to stochastic satisfiability problems
Abstract/Short Description

Determining optimal interventions in a network-based epidemiology model can be cast as a stochastic satisfiability (SSAT) problem: What is the total probability that any of a large number of sets of random events occurs? The SSAT construct appears in many guises in many domains, e.g., as Moore-Shannon network reliability in network science or as partition functions in statistical mechanics and field theory.

Authorship

Authors
Eubank S

Publication Details

Year
2021
Month
April
Day
22
Publication/Conference Proceeding Name
Computational Epidemiology
Publisher/Conference Name
GPCE Seminar Series
There is no available external link for this item
Off

Other Information

Funding Agency
National Science Foundation
Institute Technical Report Number
BI-2021-57