As a current PhD student in the interdisciplinary Algorithms, Combinatorics, and Optimization program working with Dana Randall, I study mixing times of Markov chains for certain systems with strong geometric properties; recent work has focused on rectangular tilings, graph colorings, and self-organizing particle systems. At the Mathematical Institute, University of Oxford from 2012-2013, my MSc Dissertation in Mathematics and the Foundations of Computer Science with Andreas Döring examined mathematical generalizations of the spectral presheaf, a key tool in the topos approach to quantum computer science. Other research interests include computational geometry, graph theory, and tile self-assembly, which was the topic of my Senior Honors Thesis with Diane Souvaine at Tufts University.
My recent paper "A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems" with Joshua Daymude, Dana Randall, and Andrea Richa was featured on Godel's Lost Letter and P=NP, a prominent theory blog. Check it out for an explanation of the model, the result, and some interesting connections to soft robotics.
Last year I spoke about about diversity and my experience at Georgia Tech in a video titled "Diversity at Georgia Tech: Faces of Inclusive Excellence," published by the Office of Institute Diversity.
Fellowships and Awards:
- Simons Award for Graduate Students in Theoretical Computer Science, Summer 2015 - Summer 2017.
- ARCS Foundation Award, Atlanta Chapter, for "academically outstanding US citizens studying to complete degrees in science, engineering, and medical research," 2014-2015 Scholar; 2015-2016 Scholar; 2016-2017 Scholar.
- National Science Foundation Graduate Research Fellow, Fall 2013 - Spring 2018.
- Clare Boothe Luce Outstanding Graduate Fellow, Georgia Institute of Technology, Fall 2013 - Summer 2015.
- National Defence Science and Engineering Graduate Fellowship (declined).
- "Polynomial mixing of the edge-flip Markov chain for unbiased dyadic tilings." Sarah Cannon, David Levin, and Alexandre Stauffer. Submitted.
- "A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems." Sarah Cannon, Joshua J. Daymude, Dana Randall, and Andrea Richa. ACM Symposium on Principles of Distributed Computing (PODC), July 25-29, 2016.
- "Sampling on lattices with free boundary conditions using randomized extensions." Sarah Cannon and Dana Randall. 27th Symposium on Discrete Algorithms (SODA), January 10-12, 2016.
- "Phase Transitions in Random Dyadic Tilings and Rectangular Dissections." Sarah Cannon, Sarah Miracle and Dana Randall. 26th Symposium on Discrete Algorithms (SODA), January 4-6, 2015.
- "Combinatorics and complexity of guarding polygons with edge and point 2-transmitters." Sarah Cannon, Thomas G. Fai, Justin Iwerks, Undine Leopold and Christiane Schmidt. To appear, Computational Geometry: Theory and Applications. Special Issue in Memoriam: Ferran Hurtado. Preliminary results appeared as "Combinatorics of edge 2-transmitter art gallery problems," European Conference on Computational Geometry (EuroCG), 2015, and as "NP-hardness of the minimum point and edge 2-transmitter cover problem," 24th Fall Workshop on Computational Geometry (FWCG), 2014.
- "Diffuse reflection diameter in simple polygons." Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Töth and Andrew Winslow. Discrete Applied Mathematics, in press. Previously appeared in Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS), April 22-26, 2013.
- "Two Hands are Better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM." Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert Schweller, Scott M. Summers and Andrew Winslow. Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science (STACS), February 27 - March 2, 2013.
- "Embeddedness for singly periodic Scherk surfaces with higher dihedral symmetry." Valmir Bucaj, Sarah Cannon, Michael Dorff, Jamal Lawson and Ryan Viertel. Involve: a journal of mathematics, 6(4): 383-392, 2013.
- "Hidden mobile guards in simple polygons." Sarah Cannon, Diane L. Souvaine and Andrew Winslow. In Abstracts of the 24th Canadian Conference on Computational Geometry (CCCG), August 8-10, 2012. Preliminary results presented at the Fall Workshop on Computational Geometry (FWCG), 2011.
- "Conflict-free graph orientations with parity constraints." Sarah Cannon, Mashhood Ishaque and Csaba D. Tóth. Proceedings of the Sixth International Conference on Fun with Algorithms (FUN), June 4-6, 2012. Preliminary results presented at the Fall Workshop on Computational Geometry (FWCG), 2010.
Complete CV, as of November 7th, 2016.