The Model: Moving From State to State 1 Simplified Model: Two states: = susceptible, = infected (SI Model) t=0.

Slides:



Advertisements
Similar presentations
Probability in Propagation
Advertisements

Propagation in Networks
Modeling of Complex Social Systems MATH 800 Fall 2011.
Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Connectivity Lecture _13.
1. Find the cost of each of the following using the Nearest Neighbor Algorithm. a)Start at Vertex M.
Chapter 8 Topics in Graph Theory
Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,
T h e G a s L a w s. T H E G A S L A W S z B o y l e ‘ s L a w z D a l t o n ‘ s L a w z C h a r l e s ‘ L a w z T h e C o m b i n e d G a s L a w z B.
A survey of some results on the Firefighter Problem Kah Loon Ng DIMACS Wow! I need reinforcements!
The Firefighter Problem On the Grid Joint work with Rani Hod.
Shortest Paths and Dijkstra's Algorithm CS 110: Data Structures and Algorithms First Semester,
Classical SIR and Network Models 2012 TCM Conference January 27, 2012 Dan Teague NC School of Science and Mathematics.
1 Challenges for Discrete Mathematics and Theoretical Computer Science in Homeland Security.
1 Mathematics and Bioterrorism: Graph- theoretical Models of Spread and Control of Disease.
Chapter 4 Graphs.
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
How do you simplify? Simple Complicated.
1 Graph-theoretical Problems Arising from Defending Against Bioterrorism and Controlling the Spread of Fires Fred Roberts, DIMACS.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
Contagion in Networks Networked Life NETS 112 Fall 2013 Prof. Michael Kearns.
Complexity 2-1 Problems and Languages Complexity Andrei Bulatov.
COMP108 Time Complexity of Pseudo Code. Example 1 sum = 0 for i = 1 to n do begin sum = sum + A[i] end output sum O(n)
SIR Epidemic Models CS 390/590 Fall 2009
1 Graph-theoretical Models of the Spread and Control of Disease and of Fighting Fires Fred Roberts, DIMACS.
Sanja Teodorović University of Novi Sad Faculty of Science.
1 Graph-theoretical Models of the Spread and Control of Disease and of Fighting Fires Fred Roberts, DIMACS.
Kinematic Equations with Constant Acceleration If an object moves with constant acceleration, we can use four kinematics equations Some Assumptions and.
 Propagation in Networks. Network Structure and Propagation  Diseases, fads, rumors, viral social media content all spread the same way in networks.
E PIDEMIC SPREADING Speaker: Ao Weng Chon Advisor: Kwang-Cheng Chen 1.
Mathematical Modeling of Bird Flu Propagation Urmi Ghosh-Dastidar New York City College of Technology City University of New York December 1, 2007.
Shortest Paths and Dijkstra’s Algorithm CS 105. SSSP Slide 2 Single-source shortest paths Given a weighted graph G and a source vertex v in G, determine.
Soham Uday Mehta. Linear Programming in 3 variables.
CDC's Model for West Africa Ebola Outbreak Summarized by Li Wang, 11/14.
Graph.
© 97 N. Holzschuch 3D objects representation and data structure Dr Nicolas Holzschuch University of Cape Town
1 Graph-theoretical Models of the Spread and Control of Disease and of Fighting Fires Fred Roberts, DIMACS.
 Probability in Propagation. Transmission Rates  Models discussed so far assume a 100% transmission rate to susceptible individuals (e.g. Firefighter.
Dynamics of Infectious Diseases. Using Lotka-Volterra equations? PredatorPrey VS.
Walks, Paths and Circuits. A graph is a connected graph if it is possible to travel from one vertex to any other vertex by moving along successive edges.
Firefighters Cindi King Purpose Why are firefighters important? What do firefighters do for trees? What do firefighters do for children? What do you.
Predicting the Future To Predict the Future, “all we have to have is a knowledge of how things are and an understanding of the rules that govern the changes.
1 Graph-theoretical Problems Arising from Defending Against Bioterrorism and Controlling the Spread of Fires Fred Roberts, DyDAn.
1 Graph-theoretical Problems Arising from Defending Against Bioterrorism and Controlling the Spread of Fires Fred Roberts, DIMACS.
3:00. 2:59 2:58 2:57 2:56 2:55 2:54 2:53 2:52.
Simple Equations Brackets Consider the simple equation 5(2x+3) = 3(x+9) Remove the brackets to obtain 10x + 15 = 3x + 27 Subtract 15 from both sides.
Numerical Analysis Yu Jieun.
Graphs 1 Neil Ghani University of Strathclyde. Where are we …. We studied lists: * Searching and sorting a list Then we studied trees: * Efficient search.
The Set-covering Problem Problem statement –given a finite set X and a family F of subsets where every element of X is contained in one of the subsets.
Contagion in Networks Networked Life NETS 112 Fall 2015 Prof. Michael Kearns.
AND.
Marina Leri Institute of Applied Mathematical Research
Top Fire Protection Services Ottawa available on Dubinskyconstruction
Networked Life NETS 112 Fall 2018 Prof. Michael Kearns
Spanning Trees Discrete Mathematics.
Networked Life NETS 112 Fall 2014 Prof. Michael Kearns
MA model of retina for edge detection & removing noise
Predicting the Future To Predict the Future, “all we have to have is a knowledge of how things are and an understanding of the rules that govern the changes.
CS 290H Lecture 3 Fill: bounds and heuristics
10.1 Graphs and Graph Models
Graph Theory What is a graph?.
Trends in Microbiology
5.4 – Complex Numbers.
Graph-theoretical Problems Arising from Defending Against Bioterrorism and Controlling the Spread of Fires Fred Roberts, DIMACS.
Graphs G = (V, E) V are the vertices; E are the edges.
I have 4 faces. I have 6 edges. I have 4 vertices.
Unit 2. Day 16..
© 2014 by Princeton University Press
Unit 2. Day 17..
Markus Schwehm and Martin Eichner free  traced, quarantine
Presentation transcript:

The Model: Moving From State to State 1 Simplified Model: Two states: = susceptible, = infected (SI Model) t=0

Some Simple Disease Models

The Model: Moving From State to State 3 More complex models: SI, SEI, SEIR, etc. S = susceptible, E = exposed, I = infected, R = recovered (or removed)

Irreversible 2-Threshold Process 4 t=0

5 t=1t=0 Irreversible 2-Threshold Process

6 t=1t=2 Irreversible 2-Threshold Process

7 Irreversible 3-Threshold Process t = 0 a e d c b f g

8 Irreversible 3-Threshold Process t = 0 a e d c b f g a e d c b f g t = 1

9 Irreversible 3-Threshold Process t = 1 a e d c b f g a e d c b f g t = 2

A Simple Model (k = 1) (v = 3) 10

A Simple Model 11

A Simple Model 12

A Simple Model 13

A Simple Model 14

A Simple Model 15

A Simple Model 16

17

Assumptions: 1.1 firefighter is deployed per time step 2.Fire starts at one vertex 3.Grid is finite (stops at the edges) 18

20

Saving Vertices in 21