![Page 1: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/1.jpg)
Minimal Percolating Sets with Time-Dependent
Bootstrap Percolation
Yuyuan LuoMentor: Dr. Laura Schaposnik
PRIMES ConferenceMay 19, 2019
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 1 / 12
![Page 2: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/2.jpg)
Introduction
IdeaBootstrap percolation: A deterministic process on a network wherenodes become infected once a certain number r of their neighbors areinfected.
Applications:
Fluid flow in porous areasOrientational ordering processes of magnetic alloysFailure of units in structured collection of computer memoryModeling infectious diseases
Advantages when used to model infectious diseases
Individual behaviorSpatial aspectsMixing of individuals
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 2 / 12
![Page 3: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/3.jpg)
Introduction
IdeaBootstrap percolation: A deterministic process on a network wherenodes become infected once a certain number r of their neighbors areinfected.
Applications:
Fluid flow in porous areasOrientational ordering processes of magnetic alloysFailure of units in structured collection of computer memoryModeling infectious diseases
Advantages when used to model infectious diseases
Individual behaviorSpatial aspectsMixing of individuals
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 2 / 12
![Page 4: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/4.jpg)
Introduction
IdeaBootstrap percolation: A deterministic process on a network wherenodes become infected once a certain number r of their neighbors areinfected.
Applications:
Fluid flow in porous areasOrientational ordering processes of magnetic alloysFailure of units in structured collection of computer memoryModeling infectious diseases
Advantages when used to model infectious diseases
Individual behaviorSpatial aspectsMixing of individuals
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 2 / 12
![Page 5: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/5.jpg)
Bootstrap percolation: an example
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 3 / 12
![Page 6: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/6.jpg)
Bootstrap percolation: an example
t = 0r = 2
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 3 / 12
![Page 7: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/7.jpg)
Bootstrap percolation: an example
t = 1r = 2
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 3 / 12
![Page 8: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/8.jpg)
Bootstrap percolation: an example
t = 2r = 2
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 3 / 12
![Page 9: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/9.jpg)
r -Bootstrap percolation: definition
DefinitionSuppose we have a graph G (V ,E ), some positive integer r , and a setA0 ⊂ V of initially infected nodes. Then in the r−bootstrappercolation process, the set of infected vertices at time t + 1 is givenby
At+1 = At ∪ {v ∈ V (G ) : |N(v) ∩ At | ≥ r}
where N(v) is the set of adjacent vertices to v .
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 4 / 12
![Page 10: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/10.jpg)
Minimal Percolating Set
NotationLet P(A) represent the set of nodes infected by the end of theprocess for some set A := A0.
DefinitionA percolating set is a set A such that P(A) = V .
DefinitionA percolating set A is minimal if for any v ∈ A,
P(A \ {v}) 6= V .
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 5 / 12
![Page 11: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/11.jpg)
Minimal Percolating Set
NotationLet P(A) represent the set of nodes infected by the end of theprocess for some set A := A0.
DefinitionA percolating set is a set A such that P(A) = V .
DefinitionA percolating set A is minimal if for any v ∈ A,
P(A \ {v}) 6= V .
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 5 / 12
![Page 12: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/12.jpg)
Minimal Percolating Set
NotationLet P(A) represent the set of nodes infected by the end of theprocess for some set A := A0.
DefinitionA percolating set is a set A such that P(A) = V .
DefinitionA percolating set A is minimal if for any v ∈ A,
P(A \ {v}) 6= V .
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 5 / 12
![Page 13: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/13.jpg)
Example: Minimal Percolating Set
1
3
4
2
6 7 8
5
Figure: In this tree, having nodes 2, 5, 6, 7, 8 initially infected is sufficientto ensure that the whole tree is infected at some finite time for r = 2.Further, since each of them has only 1 neighbor, removing any will causethe remaining set to not percolate.
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 6 / 12
![Page 14: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/14.jpg)
A new model: time-dependent percolation
MotivationRate of disease spread is not constant in nature.
IdeaInstead of r , use F (t).
DefinitionConsider a graph G (V ,E ), a function F (t), and a set A0 ⊂ V ofinitially infected nodes. Then in the F (t)−bootstrap percolationprocess the set of infected vertices at time t + 1 is
At+1 = At ∪ {v ∈ V (G ) : |N(v) ∩ At | ≥ dF (t)e}.
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 7 / 12
![Page 15: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/15.jpg)
A new model: time-dependent percolation
MotivationRate of disease spread is not constant in nature.
IdeaInstead of r , use F (t).
DefinitionConsider a graph G (V ,E ), a function F (t), and a set A0 ⊂ V ofinitially infected nodes. Then in the F (t)−bootstrap percolationprocess the set of infected vertices at time t + 1 is
At+1 = At ∪ {v ∈ V (G ) : |N(v) ∩ At | ≥ dF (t)e}.
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 7 / 12
![Page 16: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/16.jpg)
Smallest Minimal Percolating Sets
Problem StatementObtain an algorithm that finds a smallest minimal percolating set for any giventree T (V ,E ) and percolation function F (t).
NotationWe denote by tf (v) the largest time t we allow a node to become infected.
DefinitionSuppose we have a set of initially infected nodes A0. A node v is isolated if it isimpossible to infect it by time tf (v) by adding any one other node to A0 that isnot itself.
NotationLet v be a node that is not isolated. We denote by tp(v) the largest time t atwhich F (t) is not larger than the number of infected neighbors of v at t.
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 8 / 12
![Page 17: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/17.jpg)
Smallest Minimal Percolating Sets
Problem StatementObtain an algorithm that finds a smallest minimal percolating set for any giventree T (V ,E ) and percolation function F (t).
NotationWe denote by tf (v) the largest time t we allow a node to become infected.
DefinitionSuppose we have a set of initially infected nodes A0. A node v is isolated if it isimpossible to infect it by time tf (v) by adding any one other node to A0 that isnot itself.
NotationLet v be a node that is not isolated. We denote by tp(v) the largest time t atwhich F (t) is not larger than the number of infected neighbors of v at t.
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 8 / 12
![Page 18: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/18.jpg)
Smallest Minimal Percolating Sets
Problem StatementObtain an algorithm that finds a smallest minimal percolating set for any giventree T (V ,E ) and percolation function F (t).
NotationWe denote by tf (v) the largest time t we allow a node to become infected.
DefinitionSuppose we have a set of initially infected nodes A0. A node v is isolated if it isimpossible to infect it by time tf (v) by adding any one other node to A0 that isnot itself.
NotationLet v be a node that is not isolated. We denote by tp(v) the largest time t atwhich F (t) is not larger than the number of infected neighbors of v at t.
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 8 / 12
![Page 19: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/19.jpg)
Smallest Minimal Percolating Sets
Problem StatementObtain an algorithm that finds a smallest minimal percolating set for any giventree T (V ,E ) and percolation function F (t).
NotationWe denote by tf (v) the largest time t we allow a node to become infected.
DefinitionSuppose we have a set of initially infected nodes A0. A node v is isolated if it isimpossible to infect it by time tf (v) by adding any one other node to A0 that isnot itself.
NotationLet v be a node that is not isolated. We denote by tp(v) the largest time t atwhich F (t) is not larger than the number of infected neighbors of v at t.
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 8 / 12
![Page 20: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/20.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
∞
∞
∞ ∞ ∞
∞
∞ ∞
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 21: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/21.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
∞
∞
∞ ∞ ∞
∞
∞ ∞
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 22: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/22.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
∞
∞
∞ ∞
∞
0 ∞
∞
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 23: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/23.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
∞
∞
∞ ∞
∞
0 ∞
∞
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 24: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/24.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
∞
∞
∞
∞
0 ∞
∞ ∞
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 25: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/25.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
∞
∞
∞
∞
0 ∞
∞ ∞
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 26: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/26.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
∞
∞
∞ ∞
∞
0 ∞
∞
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 27: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/27.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
∞
∞
∞
∞
0 ∞
∞ ∞
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 28: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/28.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
∞
∞
∞ ∞
∞
∞
∞
0
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 29: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/29.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
∞
∞
∞0
∞ ∞ ∞
∞
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 30: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/30.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
∞
0
∞ ∞
∞
∞
∞0
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 31: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/31.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
∞
∞
∞0
∞ ∞ ∞
0
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 32: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/32.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
∞
∞ ∞
∞
∞
∞
0
0
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 33: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/33.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
∞
0
0
∞ ∞ ∞
∞
∞
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 34: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/34.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
0
∞ ∞ ∞
∞
∞
0
0
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 35: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/35.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
∞
0
0
∞ ∞ ∞
∞
0
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 36: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/36.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered..
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
∞ ∞ ∞
∞
∞
0
0
0
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 37: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/37.jpg)
Algorithm for F (t)-BP on T (V ,E )
Step 1. Initialize tree: Let A0 = ∅. Forv ∈ V set tf (v) arbitrarily large, and set it totrue for needing to be considered.
Step 2. Percolate using current A0. Stopthe algorithm if P(A0) = V : the resulting A0
is a smallest minimal percolating set.
Step 3. Infection. For an unconsidered vfurthest away from the root (isolated first).
if v is isolated, add v to A0.otherwise, set tf of the parent of v totp(v)− 1 if it is smaller than the currenttf of the parent.
Step 4. Go to step 2.
F (t) = t
0
0
0
∞ ∞ ∞
∞
∞
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 9 / 12
![Page 38: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/38.jpg)
Figure: The size of smallest minimal percolating sets on perfect trees withheight 4, with a constant and a non-constant percolation function
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 10 / 12
![Page 39: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/39.jpg)
Future Directions
Devise a similar algorithm for largest minimal percolating set.
Study the size of largest and smallest minimal percolating sets inspecific trees and lattices, with specific types of percolationfunctions.
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 11 / 12
![Page 40: Minimal Percolating Sets with Time-Dependent Bootstrap ...math.mit.edu/Research/Highschool/Primes/Materials/2019/Conf/10-3-Luo.pdfSmallest Minimal Percolating Sets Problem Statement](https://reader034.vdocument.in/reader034/viewer/2022042210/5eaf14909b727c50bc13b510/html5/thumbnails/40.jpg)
Acknowledgements
Dr. Laura Schaposnik
Dr. Tanya Khovanova
My parents
MIT PRIMES program
Yuyuan Luo, Mentor: Dr. Laura Schaposnik Minimal Percolating Sets PRIMES Conference 12 / 12