Show simple item record

dc.contributor.advisorFerrero, Daniela
dc.contributor.authorSchlortt, Casey Quinn ( )
dc.date.accessioned2020-07-20T18:34:05Z
dc.date.available2020-07-20T18:34:05Z
dc.date.issued2020-05
dc.identifier.citationSchlortt, C. Q. (2020). Minimum conditions for bootstrap percolation on the cubic graph (Unpublished thesis). Texas State University, San Marcos, Texas.en_US
dc.identifier.urihttps://digital.library.txstate.edu/handle/10877/12126
dc.description.abstractBootstrap 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.en_US
dc.formatText
dc.format.extent21 pages
dc.format.medium1 file (.pdf)
dc.language.isoen
dc.subjectBootstrap percolationen_US
dc.subjectCubic graphsen_US
dc.subject3-regular graphsen_US
dc.subjectIterative processen_US
dc.subject2-neighbor bootstrap percolationen_US
dc.subjectMajority bootstrap percolationen_US
dc.subjectMinimum percolating set cardinalityen_US
dc.subjectMinimum number of roundsen_US
dc.titleMinimum Conditions for Bootstrap Percolation on the Cubic Graphen_US
txstate.documenttypeThesis
thesis.degree.departmentHonors College
thesis.degree.disciplineMathematics
thesis.degree.grantorTexas State University
dc.description.departmentHonors College


Download

Thumbnail

This item appears in the following Collection(s)

Show simple item record