graphdiseasespreadmodels-threshold&firefightercapetown6-10-07
DESCRIPTION
TRANSCRIPT
![Page 1: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/1.jpg)
1
Graph-theoretical Problems Arising from Defending Against Bioterrorism and Controlling the Spread of Fires
Fred Roberts, DIMACS
![Page 2: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/2.jpg)
2
![Page 3: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/3.jpg)
3
Mathematical Models of Disease Spread
Mathematical models of infectious diseases go back to Daniel Bernoulli’s mathematical analysis of smallpox in 1760.
![Page 4: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/4.jpg)
4
Understanding infectious systems requires being able to reason about highly complex biological systems, with hundreds of demographic and epidemiological variables.
Intuition alone is insufficient to fully understand the dynamics of such systems.
smallpox
![Page 5: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/5.jpg)
5
Experimentation or field trials are often prohibitively expensive or unethical and do not always lead to fundamental understanding.
Therefore, mathematical modeling becomes an important experimental and analytical tool.
![Page 6: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/6.jpg)
6
Mathematical models have become important tools in analyzing the spread and control of infectious diseases, especially when combined with powerful, modern computer methods for analyzing and/or simulating the models.
![Page 7: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/7.jpg)
7
Great concern about the deliberate introduction of diseases by bioterrorists has led to new challenges for mathematical modelers.
anthrax
![Page 8: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/8.jpg)
8
Great concern about possibly devastating new diseases like avian influenza has also led to new challenges for mathematical modelers.
![Page 9: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/9.jpg)
9
Hundreds of math. models since Bernoulli’s models of smallpox have:
•highlighted concepts like core population in STD’s;
![Page 10: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/10.jpg)
10
•Made explicit concepts such as herd immunity for vaccination policies;
![Page 11: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/11.jpg)
11
•Led to insights about drug resistance, rate of spread of infection, epidemic trends, effects of different kinds of treatments.
![Page 12: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/12.jpg)
12
The size and overwhelming complexity of modern epidemiological problems -- and in particular the defense against bioterrorism -- calls for new approaches and tools.
![Page 13: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/13.jpg)
13
The Methods of Mathematical Epidemiology
•Statistical Methods–long history in epidemiology–changing due to large data sets involved
•Dynamical Systems–model host-pathogen systems, disease spread–difference and differential equations–little systematic use of today’s powerful computational methods
![Page 14: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/14.jpg)
14
The Methods of Mathematical Epidemiology
•Probabilistic Methods–stochastic processes, random walks, percolation, Markov chain Monte Carlo methods–simulation–need to bring in more powerful computational tools
![Page 15: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/15.jpg)
15
Discrete Mathematics
• Many fields of science, in particular molecular biology, have made extensive use of DM broadly defined.
![Page 16: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/16.jpg)
16
Discrete Mathematics
•These tools have remained largely unused and unknown in epidemiology and even mathematical epidemiology.
•However, especially with the beginning of social network analysis, DM is becoming to be more widely used.
•Goals today:
–Introduce examples of discrete models
–Make some comments about the role of mathematical modeling
![Page 17: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/17.jpg)
17
Models of the Spread and Control of Disease through Social
Networks
•Diseases are spread through social networks.•“Contact tracing” is an important part of any strategy to combat outbreaks of infectious diseases, whether naturally occurring or resulting from bioterrorist attacks.
AIDS
![Page 18: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/18.jpg)
18
The Model: Moving From State to State
Social Network = GraphVertices = PeopleEdges = contact
Let si(t) give the state of vertex i at time t.
Simplified Model: Two states: = susceptible, = infected (SI Model)
Times are discrete: t = 0, 1, 2, …
t=0
![Page 19: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/19.jpg)
19
The Model: Moving From State to State
More complex models: SI, SEI, SEIR, etc.
S = susceptible, E = exposed, I = infected, R = recovered (or removed)
measles
SARS
![Page 20: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/20.jpg)
20
Threshold Processes Irreversible k-Threshold Process: You change your state from to at time t+1 if at least k of your neighbors have state at time t. You never leave state .
Disease interpretation? Infected if sufficiently many of your neighbors are infected.
Special Case k = 1: Infected if anyof your neighbors is infected.
![Page 21: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/21.jpg)
21
Irreversible 2-Threshold Process
t=0
![Page 22: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/22.jpg)
22
t=1t=0
Irreversible 2-Threshold Process
![Page 23: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/23.jpg)
23
t=1 t=2
Irreversible 2-Threshold Process
![Page 24: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/24.jpg)
24
Irreversible 3-Threshold Process
t = 0
a
e
d c
b
f
g
![Page 25: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/25.jpg)
25
Irreversible 3-Threshold Process
t = 0
a
e
d c
b
f
g
a
e
d c
b
f
g
t = 1
![Page 26: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/26.jpg)
26
Irreversible 3-Threshold Process
t = 1
a
e
d c
b
f
g
a
e
d c
b
f
g
t = 2
![Page 27: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/27.jpg)
27
Complications to Add to Model
•k = 1, but you only get infected with a certain probability.
•You are automatically cured after you are in the infected state for d time periods.
•A public health authority has the ability to “vaccinate” a certain number of vertices, making them immune from infection.
Waiting for smallpoxvaccination, NYC, 1947
![Page 28: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/28.jpg)
28
Vaccination Strategies
Mathematical models are very helpful in comparing alternative vaccination strategies. The problem is especially interesting if we think of protecting against deliberate infection by a bioterrorist.
![Page 29: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/29.jpg)
29
Vaccination StrategiesIf you didn’t know whom a bioterrorist might infect, what people would you vaccinate to be sure that a disease doesn’t spread very much? (Vaccinated vertices stay at state regardless of the state of their neighbors.)
Try odd cycles. Consider an irreversible 2-threshold process. Suppose your adversary has enough supply to infect two individuals.
5-cycle C5
![Page 30: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/30.jpg)
30
Vaccination Strategies One strategy: “Mass vaccination”: Make everyone and immune in initial state.
In 5-cycle C5, mass vaccination means vaccinate 5 vertices. This obviously works.
In practice, vaccination is only effective with a certain probability, so results could be different.
Can we do better than mass vaccination?
What does better mean? If vaccine has no cost and is unlimited and has no side effects, of course we use mass vaccination.
![Page 31: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/31.jpg)
31
Vaccination Strategies
What if vaccine is in limited supply? Suppose we only have enough vaccine to vaccinate 2 vertices. two different vaccination strategies:
Vaccination Strategy I Vaccination Strategy II
VV
V
V
![Page 32: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/32.jpg)
32
Vaccination Strategy I: Worst Case (Adversary Infects Two)Two Strategies for Adversary
Adversary Strategy Ia Adversary Strategy Ib
VV
I
I
VV
I I
This assumes adversary doesn’t attack a vaccinated vertex. Problem is interesting if this could happen – or you encourage it to happen.
![Page 33: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/33.jpg)
33
The “alternation” between your choice of a defensive strategy and your adversary’s choice of an offensive strategy suggests we consider the problem from thepoint of view of game theory.
The Food and Drug Administration is studyingthe use of game-theoreticmodels in the defense against bioterrorism.
![Page 34: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/34.jpg)
34
Vaccination Strategy I Adversary Strategy Ia
VV
I
It = 0
![Page 35: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/35.jpg)
35
Vaccination Strategy I Adversary Strategy Ia
VV
I
I
VV
I
It = 0 t = 1
![Page 36: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/36.jpg)
36
Vaccination Strategy I Adversary Strategy Ia
VV
I
I
VV
I
It = 1 t = 2
![Page 37: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/37.jpg)
37
Vaccination Strategy I Adversary Strategy Ib
VV
I I
t = 0
![Page 38: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/38.jpg)
38
Vaccination Strategy I Adversary Strategy Ib
VV
I I
VV
I I
t = 0 t = 1
![Page 39: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/39.jpg)
39
Vaccination Strategy I Adversary Strategy Ib
VV
I
I
VV
I
It = 1 t = 2
![Page 40: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/40.jpg)
40
Vaccination Strategy II: Worst Case (Adversary Infects Two)Two Strategies for Adversary
Adversary Strategy IIa Adversary Strategy IIb
V
V
V
V
I
I
I
I
![Page 41: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/41.jpg)
41
Vaccination Strategy II Adversary Strategy IIa
V
V
I
I t = 0
![Page 42: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/42.jpg)
42
Vaccination Strategy II Adversary Strategy IIa
V
V
I
I t = 0
V
V
I
I t = 1
![Page 43: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/43.jpg)
43
Vaccination Strategy II Adversary Strategy IIa
V
V
I
I t = 1
V
V
I
I t = 2
![Page 44: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/44.jpg)
44
Vaccination Strategy II Adversary Strategy IIb
V
V
I
t = 0
I
![Page 45: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/45.jpg)
45
Vaccination Strategy II Adversary Strategy IIb
V
V
I
t = 0
I
V
V
t = 1
![Page 46: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/46.jpg)
46
Vaccination Strategy II Adversary Strategy IIb
V
V
I
t = 1
I
V
V
t = 2
![Page 47: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/47.jpg)
47
Conclusions about Strategies I and II
Vaccination Strategy II never leads to more than two infected individuals, while Vaccination Strategy I sometimes leads to three infected individuals (depending upon strategy used by adversary).
Thus, Vaccination Strategy II is better.
More on vaccination strategies later.
![Page 48: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/48.jpg)
48
The Saturation ProblemAttacker’s Problem: Given a graph, what subsets S of the vertices should we plant a disease with so that ultimately the maximum number of people will get it?
Economic interpretation: What set of people do we place a new product with to guarantee “saturation” of the product in the population?
Defender’s Problem: Given a graph, what subsets S of the vertices should we vaccinate to guarantee that as few people as possible will be infected?
![Page 49: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/49.jpg)
49
k-Conversion Sets
Attacker’s Problem: Can we guarantee that ultimately everyone is infected?
Irreversible k-Conversion Set: Subset S of the vertices that can force an irreversible k-threshold process to the situation where every state si(t) = ?
Comment: If we can change back from to at least after awhile, we can also consider the Defender’s Problem: Can we guarantee that ultimately no one is infected, i.e., all si(t) = ?
![Page 50: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/50.jpg)
50
What is an irreversible 2-conversion set for the following graph?
x1 x2 x3 x4 x6
x5
![Page 51: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/51.jpg)
51
x1, x3 is an irreversible 2-conversion set.
x1 x2 x3 x4 x6
x5
t = 0
![Page 52: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/52.jpg)
52
x1, x3 is an irreversible 2-conversion set.
x1 x2 x3 x4 x6
x5
t = 1
![Page 53: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/53.jpg)
53
x1, x3 is an irreversible 2-conversion set.
x1 x2 x3 x4 x6
x5
t = 2
![Page 54: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/54.jpg)
54
x1, x3 is an irreversible 2-conversion set.
x1 x2 x3 x4 x6
x5
t = 3
![Page 55: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/55.jpg)
55
Irreversible k-Conversion Sets in Regular Graphs
G is r-regular if every vertex has degree r.Degree = number of neighbors.Set of vertices is independent if there are no edges.
•C5 is 2-regular.•The two circled vertices form anindependent set. •No set of three vertices is independent.•The largest independent set hassize floor[5/2] = 2.
![Page 56: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/56.jpg)
56
Irreversible k-Conversion Sets in Regular Graphs
G is r-regular if every vertex has degree r.Set of vertices is independent if there are no edges.
Theorem (Dreyer 2000): Let G = (V,E) be a connected r-regular graph and D be a set of vertices. Then D is an irreversible r-conversion set iff V-D is an independent set.
Note: same r
![Page 57: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/57.jpg)
57
k-Conversion Sets in Regular Graphs
Corollary (Dreyer 2000): The size of the smallest irreversible 2- conversion set in Cn is ceiling[n/2].
![Page 58: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/58.jpg)
58
k-Conversion Sets in Regular Graphs
Corollary (Dreyer 2000): The size of the smallest irreversible 2- conversion set in Cn is ceiling[n/2].
C5 is 2-regular. The smallest irreversible 2-conversion set has three vertices: the red ones.
![Page 59: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/59.jpg)
59
k-Conversion Sets in Regular Graphs
Corollary (Dreyer 2000): The size of the smallest irreversible 2- conversion set in Cn is ceiling[n/2].
Proof: Cn is 2-regular. The largest independent set has size floor[n/2]. Thus, the smallest D so that V-D is independent has size ceiling[n/2].
![Page 60: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/60.jpg)
60
k-Conversion Sets in Regular Graphs
Another Example:
a
e
d c
b
f
![Page 61: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/61.jpg)
61
k-Conversion Sets in Regular GraphsAnother Example: This is 3- regular.Let k = 3. The largest independent set has 2 vertices.
a
e
d c
b
f
![Page 62: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/62.jpg)
62
k-Conversion Sets in Regular Graphs•The largest independent set has 2 vertices. •Thus, the smallest irreversible 3-conversion set has 6-2 = 4 vertices.•The 4 red vertices form such a set.•Each other vertex has threered neighbors.
a
e
d c
b
f
![Page 63: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/63.jpg)
63
Irreversible k-Conversion Sets in Graphs of Maximum Degree r
Theorem (Dreyer 2000): Let G = (V,E) be a connected graph with maximum degree r and S be the set of all vertices of degree < r. If D is a set of vertices, then D is an irreversible r-conversion set iff SD and V-D is an independent set.
![Page 64: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/64.jpg)
64
How Hard is it to Find out if There is an Irreversible k-Conversion Set of
Size at Most p?
Problem IRREVERSIBLE k-CONVERSION SET: Given a positive integer p and a graph G, does G have an irreversible k-conversion set of size at most p?
How hard is this problem?
![Page 65: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/65.jpg)
65
Difficulty of Finding Irreversible Conversion Sets
Problem IRREVERSIBLE k-CONVERSION SET: Given a positive integer p and a graph G, does G have an irreversible k-conversion set of size at most p?
Theorem (Dreyer 2000): IRREVERSIBLE k-CONVERSION SET is NP-complete for fixed k > 2.
(Whether or not it is NP-complete for k = 2 remains open.)Thus in technical CS terms, the problem is HARD.
![Page 66: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/66.jpg)
66
Irreversible k-Conversion Sets in Trees
![Page 67: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/67.jpg)
67
Irreversible k-Conversion Sets in Trees
• Tree = graph with:
– (1) no cycles
– (2) you can get from every vertex to every other vertex (connectedness)
![Page 68: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/68.jpg)
68
Irreversible k-Conversion Sets in TreesThe simplest case is when every internal vertex of the tree has degree > k.Leaf = vertex of degree 1; internal vertex = not a leaf.
What is an irreversible 2-conversion set here?
![Page 69: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/69.jpg)
69
Irreversible k-Conversion Sets in TreesThe simplest case is when every internal vertex of the tree has degree > k.Leaf = vertex of degree 1; internal vertex = not a leaf.
What is an irreversible 2-conversion set here?
Do you know any verticesthat have to be in such a set?
![Page 70: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/70.jpg)
70
![Page 71: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/71.jpg)
71
All leaves have to be in it.
![Page 72: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/72.jpg)
72
All leaves have to be in it.
This will suffice.
t = 0
![Page 73: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/73.jpg)
73
All leaves have to be in it.
This will suffice.
t = 0 t = 1
![Page 74: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/74.jpg)
74
All leaves have to be in it.
This will suffice.
t = 1 t = 2
![Page 75: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/75.jpg)
75
Irreversible k-Conversion Sets in Trees
So k = 2 is easy. What about k > 2? Also easy.
Proposition (Dreyer 2000): Let T be a tree and every internal vertex have degree > k, where k > 1. Then the smallest irreversible k-conversion set has size equal to the number of leaves of the tree.
![Page 76: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/76.jpg)
76
Irreversible k-Conversion Sets in Trees
What if not every internal vertex has degree > k?
If there is an internal vertex of degree < k, it will have to be in any irreversible k-conversion set and will never change sign.
So, to every neighbor, this vertex v acts like a leaf, and we can break T into deg(v) subtrees with v a leaf in each.
If every internal vertex has degree k, one can obtain analogous results to those for the > k case by looking at maximal connected subsets of vertices of degree k.
![Page 77: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/77.jpg)
77
Irreversible k-Conversion Sets in Trees
What if not every internal vertex has degree > k?
Question: Can you find an example where the set of leaves is not an irreversible k-conversion set?
![Page 78: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/78.jpg)
78
Irreversible k-Conversion Sets in Trees
What if not every internal vertex has degree > k?
Question: Can you find an example where the set of leaves is not an irreversible k-conversion set?
Yes: if a vertex has degree < k, even if it is not a leaf, it must be in every irreversible k-conversion set.
![Page 79: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/79.jpg)
79
Irreversible k-Conversion Sets in Trees
Dreyer presents an O(n) algorithm for finding the size of the smallest irreversible k-conversion set in a tree of n vertices.
O(n) is considered very efficient.
![Page 80: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/80.jpg)
80
Irreversible k-Conversion Sets in Special Graphs
Studied for many special graphs.
Let G(m,n) be the rectangular grid graph with m rows and n columns.
G(3,4)
![Page 81: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/81.jpg)
81
Toroidal Grids
The toroidal grid T(m,n) is obtained from the rectangular grid G(m,n) by adding edges from the first vertex in each row to the last and from the first vertex in each column to the last.
Toroidal grids are easier to deal with than rectangular grids because they form regular graphs: Every vertex has degree 4. Thus, we can make use of the results about regular graphs.
![Page 82: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/82.jpg)
82
T(3,4)
![Page 83: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/83.jpg)
83
Irreversible4-Conversion Sets in Toroidal Grids
Theorem (Dreyer 2000): In a toroidal grid T(m,n),the size of the smallest irreversible 4-conversion set is
max{n(ceiling[m/2]), m(ceiling[n/2])} m or n odd
mn/2 m, n even{
![Page 84: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/84.jpg)
84
Part of the Proof: Recall that D is an irreversible 4-conversion set in a 4-regular graph iff V-D is independent.
V-D independent means that every edge {u,v} in G has u or v in D. In particular, the ith row must contain at least ceiling[n/2] vertices in D and the ith column at least ceiling[m/2] vertices in D (alternating starting with the end vertex of the row or column).
We must cover all rows and all columns, and so need at least max{n(ceiling[m/2]), m(ceiling[n/2])} vertices in an irreversible 4-conversion set.
![Page 85: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/85.jpg)
85
Irreversible k-Conversion Sets for Rectangular Grids
Let Ck(G) be the size of the smallest irreversiblek-conversion set in graph G.
Theorem (Dreyer 2000):
C4[G(m,n)] = 2m + 2n - 4 + floor[(m-2)(n-2)/2]
Theorem (Flocchini, Lodi, Luccio, Pagli, and Santoro):
C2[G(m,n)] = ceiling([m+n]/2)
![Page 86: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/86.jpg)
86
Irreversible 3-Conversion Sets for Rectangular Grids
For 3-conversion sets, the best we have are bounds:
Theorem (Flocchini, Lodi, Luccio, Pagli, and Santoro): [(m-1)(n-1)+1]/3 C3[G(m,n)]
[(m-1)(n-1)+1]/3 +[3m+2n-3]/4 + 5
Finding the exact value is an open problem.
![Page 87: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/87.jpg)
87
Irreversible Conversion Sets for Rectangular Grids
Exact values are known for the size of the smallest irreversible k-conversion set for some special classes of graphs and some values of k:
2xn grids, 3xn grids, trees, etc.
![Page 88: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/88.jpg)
88
Bounds on the Size of the Smallest Conversion Sets
In general, it is difficult to get exact values for the size of the smallest irreversible k-conversion set in a graph.
So, what about bounds?
Sample result:
Theorem (Dreyer, 2000): If G is an r-regular graph with n vertices, then Ck(G) (1 – r/2k)n for k r 2k.
![Page 89: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/89.jpg)
89
Vaccination StrategiesStephen Hartke worked on a different problem:
Defender: can vaccinate v people per time period. Attacker: can only infect people at the beginning. Irreversible k-threshold model.What vaccination strategy minimizes number of people infected?
Sometimes called the firefighter problem:alternate fire spread and firefighter placement.Usual assumption: k = 1. (We will assume this.)
Variation: The vaccinator and infector alternate turns, having v vaccinations per period and i doses of pathogen per period. What is a good strategy for the vaccinator?
Chapter in Hartke’s Ph.D. thesis at Rutgers (2004)
![Page 90: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/90.jpg)
90
A Survey of Some Results on the Firefighter Problem
Thanks toKah Loon Ng
DIMACSFor the following slides,slightly modified by me
![Page 91: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/91.jpg)
91
Mathematicians can be Lazy
![Page 92: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/92.jpg)
92
Mathematicians can be Lazy•Different application.•Different terminology•Same mathematical model.
measles
![Page 93: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/93.jpg)
93
A Simple Model (k = 1) (v = 3)
![Page 94: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/94.jpg)
94
A Simple Model
![Page 95: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/95.jpg)
95
A Simple Model
![Page 96: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/96.jpg)
96
A Simple Model
![Page 97: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/97.jpg)
97
A Simple Model
![Page 98: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/98.jpg)
98
A Simple Model
![Page 99: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/99.jpg)
99
A Simple Model
![Page 100: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/100.jpg)
100
A Simple Model
![Page 101: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/101.jpg)
101
Some questions that can be asked (but not necessarily answered!)
• Can the fire be contained?• How many time steps are required before fire is
contained?• How many firefighters per time step are necessary?• What fraction of all vertices will be saved (burnt)?• Does where the fire breaks out matter?• Fire starting at more than 1 vertex?• Consider different graphs. Construction of
(connected) graphs to minimize damage.• Complexity/Algorithmic issues
![Page 102: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/102.jpg)
102
Containing Fires in Infinite Grids Ld
Fire starts at only one vertex:
d= 1: Trivial.
d = 2: Impossible to contain the fire with 1 firefighter per time step
![Page 103: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/103.jpg)
103
Containing Fires in Infinite Grids Ld
d = 2: Two firefighters per time step needed to contain the fire.
8 time steps
18 burnt vertices
![Page 104: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/104.jpg)
104
……
Containing Fires in Infinite Grids Ld
d 3: Wang and Moeller (2002): If G is an r-regular graph, r – 1 firefighters per time step is always sufficient to contain any fire outbreak (at a single vertex) in G. (r-regular: every vertex has r neighbors.)
.….
![Page 105: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/105.jpg)
105
Containing Fires in Infinite Grids Ld
d 3: In Ld, every vertex has degree 2d.
Thus: 2d-1 firefighters per time step are sufficient to contain any outbreak starting at a single vertex.
Theorem (Hartke 2004): If d 3, 2d – 2 firefighters per time step are not enough to contain an outbreak in Ld.
Thus, 2d – 1 firefighters per time step is the minimum number required to contain an outbreak in Ld and containment can be attained in 2 time steps.
![Page 106: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/106.jpg)
106
Containing Fires in Infinite Grids Ld
Fire can start at more than one vertex.
d = 2: Fogarty (2003): Two firefighters per time step are sufficient to contain any outbreak at a finite number of vertices.
d 3: Hartke (2004): For any d 3 and any positive integer f, f firefighters per time step is not sufficient to contain all finite outbreaks in Ld. In other words, for d 3 and any positive integer f, there is an outbreak such that f firefighters per time step cannot contain the outbreak.
![Page 107: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/107.jpg)
107
Containing Fires in Infinite Grids Ld
The case of a different number of firefighters per time step.
Let f(t) = number firefighters available at time t.
Assume f(t) is periodic with period pf.
Possible motivations for periodicity: •Firefighters arrive in batches.•Firefighters need to stay at a vertex for several time periods before redeployment.
![Page 108: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/108.jpg)
108
Containing Fires in Infinite Grids Ld
The case of a different number of firefighters per time step.
Nf = f(1) + f(2) + … + f(pf)
Rf = Nf/pf
(average number firefighters available per time period)
Theorem (Ng and Raff 2006): If d =2 and f is periodic with period pf 1 and Rf > 1.5, then an outbreak at any number of vertices can be contained at a finite number of vertices.
![Page 109: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/109.jpg)
109
Saving Vertices in Finite Grids G
Assumptions:
1. 1 firefighter is deployed per time step
2. Fire starts at one vertex
Let
MVS(G, v) = maximum number of vertices that can be saved in G if fire starts at v.
![Page 110: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/110.jpg)
110
Saving Vertices in Finite Grids Gnn PPG },|),{()( nbabaGV 1
2n
2n
))(()()),(,( anabnnbaPPMVS nn 1 21 nab
),( 11 ),( n1
![Page 111: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/111.jpg)
Saving Vertices in Finite Grids Gnn PPG },|),{()( nbabaGV 1
))(()()),(,( anabnnbaPPMVS nn 1 21 nab
![Page 112: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/112.jpg)
112
Saving Vertices in Finite Grids Gnn PPG },|),{()( nbabaGV 1
nnnnPPMVS nn 2111 )()),(,(
![Page 113: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/113.jpg)
113
Saving Vertices in nml PPP
21111633 )),,(,( PPPMVS
,)),,(,( 33911133 nPPPMVS n 6n
![Page 114: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/114.jpg)
114
Algorithmic and Complexity Matters
FIREFIGHTER:
Instance: A rooted graph (G,u) and an integer p 1.
Question: Is MVS(G,u) p? That is, is there a finite sequence d1, d2, …, dt of vertices of G such that if the fire breaks out at u, then,
1. vertex di is neither burning nor defended at time i
2. at time t, no undefended vertex is next to a burning vertex
3. at least p vertices are saved at the end of time t.
![Page 115: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/115.jpg)
115
Algorithmic and Complexity Matters
Theorem (MacGillivray and Wang, 2003): FIREFIGHTER is NP-complete.
Thus, it is HARD in the sense of computer science.
![Page 116: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/116.jpg)
116
Algorithmic and Complexity Matters
Firefighting on Trees:
![Page 117: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/117.jpg)
117
Algorithmic and Complexity Matters
Greedy algorithm:
For each v in V(T), define
weight (v) = number descendants of v + 1
Algorithm: At each time step, place firefighter at vertex that has not been saved such that weight (v) is maximized.
![Page 118: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/118.jpg)
118
Algorithmic and Complexity Matters
Firefighting on Trees:
78912 11
324161512 6
12 1131111 3 1
26
22
![Page 119: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/119.jpg)
119
Algorithmic and Complexity Matters
Greedy Optimal
= 7 = 9
![Page 120: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/120.jpg)
120
Algorithmic and Complexity Matters
Theorem (Hartnell and Li, 2000): For any tree with one fire starting at the root and one firefighter to be deployed per time step, the greedy algorithm always saves more than ½ of the vertices that any algorithm saves.
![Page 121: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/121.jpg)
121
More Realistic ModelsMany oversimplifications in both of our models. For instance:
•What if you stay infected (burning)only a certain number of days?
•What if you are not necessarily infective for the first few days you are sick?
•What if your threshold k for changes from to (uninfected to infected) changes depending upon how long you have been uninfected?
measles
![Page 122: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/122.jpg)
122
More Realistic ModelsConsider an irreversible process in which you stay in the infected state (state ) for d time periods after entering it and then go back to the uninfected state (state ).
Consider an irreversible k-threshold process in which we vaccinate a person in state once k-1 neighbors are infected (in state ).
Etc. – experiment with a variety of assumptions
![Page 123: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/123.jpg)
123
More Realistic ModelsOur models are deterministic. How do probabilities enter?
•What if you only get infected with a certain probability if you meet an infected person?
•What if vaccines only work with a certain probability?
•What if the amount of time you remain infective exhibits a probability distribution?
![Page 124: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/124.jpg)
124
Would Graph Theory help with an outbreak of Bovine TB?
![Page 125: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/125.jpg)
125
What about an outbreak of Avian Flu?
![Page 126: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/126.jpg)
126
Similar approaches using mathematical models have proven useful in public health and many other fields, to: •make policy•plan operations•analyze risk•compare interventions•identify the cause of observed events
•So, why not for the spread of infectious disease?
![Page 127: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/127.jpg)
127
Other QuestionsCan you use graph-theoretical models to analyze the effect of different quarantine strategies?
Don’t forget diseases of plants.
![Page 128: GraphDiseaseSpreadModels-Threshold&FirefighterCapeTown6-10-07](https://reader036.vdocuments.us/reader036/viewer/2022070301/5453656fb1af9f88228b45ce/html5/thumbnails/128.jpg)
128
There is much more analysis of a similar nature that can be done with mathematical models. Let your imagination run free!