Graduation Year
2014
Document Type
Open Access Senior Thesis
Degree Name
Bachelor of Science
Department
Mathematics
Reader 1
Susan E. Martonosi
Reader 2
Mohamed Omar
Terms of Use & License Information
Rights Information
© 2014 Samuel C. Gutekunst
Abstract
This thesis studies a problem that has been proposed as a novel way to disrupt communication networks: the load maximization problem. The load on a member of a network represents the amount of communication that the member is forced to be involved in. By maximizing the load on an important member of the network, we hope to increase that member's visibility and susceptibility to capture. In this thesis we characterize load as a combinatorial property of graphs and expose possible connections between load and spectral graph theory. We specifically describe the load and how it changes in several canonical classes of graphs and determine the range of values that the load can take on. We also consider a connection between load and liquid paint flow and use this connection to build a heuristic solver for the load maximization problem. We conclude with a detailed discussion of open questions for future work.
Recommended Citation
Gutekunst, Samuel C., "Characterizing Forced Communication in Networks" (2014). HMC Senior Theses. 56.
https://scholarship.claremont.edu/hmc_theses/56
Source Fulltext
http://www.math.hmc.edu/~sgutekunst/thesis/thesis.pdf
