With the advances in technology, the quantity of data being collected is increasing. Noisy data and poor samplings add to the issues that can arise in analysis. Topological data analysis (TDA) uses concepts from algebra, topology and combinatorics to extract information about the structure of data. This is an active field of study as more efficient methods to analyze data are needed. My research studies the properties between graph theory and simplicial homology which can be applied to the set of tools used in TDA. In this research, I have defined a process for determining structure which can handle larger sets of data points than current methods.

## MAA MathFest PosterFest, August 2013

In August 2013, I gave a poster presentation during MathFest in Hartford, CT. A pdf file of my poster can be found Here.

## Talks and Presentations

*Fun with Shapes: Blocks and Hexaflexagons*, Greenslopes Seminar, April 10, 2014, Fort Collins, CO.

*, 2014 Joint Math Meetings, Pure and Applied Talks by Women Math Warriors presented by EDGE, January 18, 2014, Baltimore, MD.*

Homology of the D-Neighborhood Complex of Graphs

Homology of the D-Neighborhood Complex of Graphs

*Cycle Graphs Make the World Go Round*, Greenslopes Seminar, October 10, 2013, Fort Collins, CO.

*Homology of the D-Neighborhood Complex on Graphs*, MathFest Poster Session, August 2, 2013, Hartford, CT.

*The D-Neighborhood Complex on Graphs*, Rocky Mountain Discrete Math Days, June 23, 2013, Laramie, WY.

*Reduced Homology of the D-Neighborhood on Simple Graphs*, Greenslopes Seminar, April 11, 2013, Fort Collins, CO.