Honors College Capstones
Permanent URI for this collectionhttps://hdl.handle.net/10877/17056
Browse
Browsing Honors College Capstones by Subject "2-neighbor bootstrap percolation"
Now showing 1 - 1 of 1
Results Per Page
Sort Options
Item Minimum Conditions for Bootstrap Percolation on the Cubic Graph(2020-05) Schlortt, Casey Quinn; Ferrero, DanielaBootstrap percolation is an iterative process on the vertices of a graph. Initially, a proper, non-empty set of vertices is infected, and all other vertices are uninfected. At each iteration, every uninfected vertex with a certain number of infected neighbors becomes infected, and all infected vertices remain so permanently. At the end of the process, if all vertices are infected, percolation occurs. In this case, the initial set of infected vertices percolates the graph. Necessary and sufficient conditions for the minimum size of a percolating set and the minimum number of rounds to achieve percolation on a cubic graph of order 2n are presented, for any integer n, 2n ≥ 4.